./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/config/TaipanReach.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_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan --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 Taipan --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-1dbac8b [2018-10-26 23:15:05,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:15:05,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:15:05,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:15:05,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:15:05,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:15:05,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:15:05,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:15:05,697 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:15:05,698 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:15:05,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:15:05,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:15:05,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:15:05,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:15:05,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:15:05,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:15:05,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:15:05,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:15:05,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:15:05,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:15:05,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:15:05,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:15:05,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:15:05,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:15:05,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:15:05,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:15:05,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:15:05,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:15:05,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:15:05,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:15:05,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:15:05,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:15:05,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:15:05,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:15:05,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:15:05,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:15:05,722 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:15:05,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:15:05,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:15:05,736 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:15:05,736 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:15:05,736 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:15:05,736 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:15:05,736 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:15:05,737 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:15:05,737 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:15:05,737 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:15:05,737 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:15:05,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:15:05,738 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:15:05,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:15:05,738 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:15:05,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:15:05,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:15:05,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:15:05,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:15:05,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:15:05,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:15:05,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:15:05,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:15:05,741 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:15:05,741 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:15:05,741 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:15:05,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:15:05,741 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:15:05,742 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan 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 -> Taipan 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-10-26 23:15:05,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:15:05,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:15:05,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:15:05,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:15:05,790 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:15:05,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-10-26 23:15:05,849 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/data/edbe32b1a/a10a0e5633d545d1a6f365daf82885d7/FLAGeede435a1 [2018-10-26 23:15:06,293 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:15:06,294 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-10-26 23:15:06,308 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/data/edbe32b1a/a10a0e5633d545d1a6f365daf82885d7/FLAGeede435a1 [2018-10-26 23:15:06,323 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/data/edbe32b1a/a10a0e5633d545d1a6f365daf82885d7 [2018-10-26 23:15:06,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:15:06,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:15:06,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:15:06,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:15:06,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:15:06,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c96878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06, skipping insertion in model container [2018-10-26 23:15:06,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:15:06,390 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:15:06,620 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:15:06,624 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:15:06,686 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:15:06,701 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:15:06,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06 WrapperNode [2018-10-26 23:15:06,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:15:06,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:15:06,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:15:06,703 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:15:06,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:15:06,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:15:06,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:15:06,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:15:06,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... [2018-10-26 23:15:06,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:15:06,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:15:06,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:15:06,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:15:06,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/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-10-26 23:15:06,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:15:06,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:15:06,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:15:06,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:15:06,932 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 23:15:06,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 23:15:06,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:15:06,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:15:07,144 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:15:07,144 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:15:08,180 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:15:08,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:15:08 BoogieIcfgContainer [2018-10-26 23:15:08,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:15:08,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:15:08,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:15:08,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:15:08,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:15:06" (1/3) ... [2018-10-26 23:15:08,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3c32bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:15:08, skipping insertion in model container [2018-10-26 23:15:08,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:15:06" (2/3) ... [2018-10-26 23:15:08,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3c32bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:15:08, skipping insertion in model container [2018-10-26 23:15:08,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:15:08" (3/3) ... [2018-10-26 23:15:08,198 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-10-26 23:15:08,210 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:15:08,223 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:15:08,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:15:08,276 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:15:08,277 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:15:08,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:15:08,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:15:08,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:15:08,281 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:15:08,282 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:15:08,282 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:15:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-10-26 23:15:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 23:15:08,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:08,327 INFO L375 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, 1] [2018-10-26 23:15:08,329 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:08,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1681840524, now seen corresponding path program 1 times [2018-10-26 23:15:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:08,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:15:08,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:08,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:08,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:08,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:08,660 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-10-26 23:15:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:08,923 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-10-26 23:15:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:08,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 23:15:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:08,941 INFO L225 Difference]: With dead ends: 380 [2018-10-26 23:15:08,941 INFO L226 Difference]: Without dead ends: 222 [2018-10-26 23:15:08,946 INFO L605 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-10-26 23:15:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-26 23:15:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-10-26 23:15:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 23:15:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-10-26 23:15:09,008 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-10-26 23:15:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:09,008 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-10-26 23:15:09,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-10-26 23:15:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:15:09,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:09,012 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 23:15:09,012 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:09,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash -770617106, now seen corresponding path program 1 times [2018-10-26 23:15:09,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:09,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:09,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:15:09,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:09,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:09,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:09,140 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-10-26 23:15:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:09,651 INFO L93 Difference]: Finished difference Result 478 states and 716 transitions. [2018-10-26 23:15:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:09,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-26 23:15:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:09,656 INFO L225 Difference]: With dead ends: 478 [2018-10-26 23:15:09,656 INFO L226 Difference]: Without dead ends: 268 [2018-10-26 23:15:09,658 INFO L605 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-10-26 23:15:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-26 23:15:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-10-26 23:15:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-26 23:15:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-10-26 23:15:09,679 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-10-26 23:15:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:09,679 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-10-26 23:15:09,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-10-26 23:15:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 23:15:09,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:09,683 INFO L375 BasicCegarLoop]: trace histogram [3, 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-10-26 23:15:09,683 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:09,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash -93589576, now seen corresponding path program 1 times [2018-10-26 23:15:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:09,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:09,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:15:09,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:09,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:09,856 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:09,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:09,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:09,857 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-10-26 23:15:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:10,443 INFO L93 Difference]: Finished difference Result 556 states and 817 transitions. [2018-10-26 23:15:10,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:10,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 23:15:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:10,447 INFO L225 Difference]: With dead ends: 556 [2018-10-26 23:15:10,447 INFO L226 Difference]: Without dead ends: 310 [2018-10-26 23:15:10,449 INFO L605 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-10-26 23:15:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-26 23:15:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2018-10-26 23:15:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-26 23:15:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2018-10-26 23:15:10,472 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 63 [2018-10-26 23:15:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:10,472 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2018-10-26 23:15:10,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2018-10-26 23:15:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 23:15:10,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:10,477 INFO L375 BasicCegarLoop]: trace histogram [3, 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-10-26 23:15:10,477 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:10,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash 40423930, now seen corresponding path program 1 times [2018-10-26 23:15:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:10,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:10,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:10,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:15:10,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:10,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:10,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:10,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:10,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:10,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:10,611 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand 3 states. [2018-10-26 23:15:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:11,029 INFO L93 Difference]: Finished difference Result 690 states and 1014 transitions. [2018-10-26 23:15:11,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:11,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 23:15:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:11,032 INFO L225 Difference]: With dead ends: 690 [2018-10-26 23:15:11,032 INFO L226 Difference]: Without dead ends: 400 [2018-10-26 23:15:11,033 INFO L605 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-10-26 23:15:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-26 23:15:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 382. [2018-10-26 23:15:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-26 23:15:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-10-26 23:15:11,056 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-10-26 23:15:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:11,056 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-10-26 23:15:11,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-10-26 23:15:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 23:15:11,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:11,062 INFO L375 BasicCegarLoop]: trace histogram [4, 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-10-26 23:15:11,062 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:11,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:11,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1896332607, now seen corresponding path program 1 times [2018-10-26 23:15:11,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:11,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:15:11,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:11,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:11,163 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:11,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:11,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:11,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:11,165 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-10-26 23:15:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:11,468 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-10-26 23:15:11,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:11,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-26 23:15:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:11,474 INFO L225 Difference]: With dead ends: 860 [2018-10-26 23:15:11,474 INFO L226 Difference]: Without dead ends: 488 [2018-10-26 23:15:11,476 INFO L605 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-10-26 23:15:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-26 23:15:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-10-26 23:15:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-26 23:15:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-10-26 23:15:11,505 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-10-26 23:15:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:11,506 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-10-26 23:15:11,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-10-26 23:15:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 23:15:11,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:11,513 INFO L375 BasicCegarLoop]: trace histogram [4, 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-10-26 23:15:11,513 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:11,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1579938826, now seen corresponding path program 1 times [2018-10-26 23:15:11,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:11,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:11,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 23:15:11,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:11,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:11,634 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:11,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:11,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:11,636 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-10-26 23:15:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:11,813 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-10-26 23:15:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:11,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-10-26 23:15:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:11,818 INFO L225 Difference]: With dead ends: 962 [2018-10-26 23:15:11,819 INFO L226 Difference]: Without dead ends: 512 [2018-10-26 23:15:11,820 INFO L605 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-10-26 23:15:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-26 23:15:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-10-26 23:15:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-26 23:15:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-10-26 23:15:11,840 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-10-26 23:15:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:11,841 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-10-26 23:15:11,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-10-26 23:15:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:15:11,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:11,844 INFO L375 BasicCegarLoop]: trace histogram [5, 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-10-26 23:15:11,845 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:11,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1478150613, now seen corresponding path program 1 times [2018-10-26 23:15:11,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:11,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:11,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:11,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:11,849 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:15:11,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:11,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:11,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:11,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:11,988 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-10-26 23:15:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:12,265 INFO L93 Difference]: Finished difference Result 1000 states and 1421 transitions. [2018-10-26 23:15:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:12,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 23:15:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:12,272 INFO L225 Difference]: With dead ends: 1000 [2018-10-26 23:15:12,273 INFO L226 Difference]: Without dead ends: 752 [2018-10-26 23:15:12,275 INFO L605 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-10-26 23:15:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-10-26 23:15:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2018-10-26 23:15:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-26 23:15:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1065 transitions. [2018-10-26 23:15:12,322 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1065 transitions. Word has length 102 [2018-10-26 23:15:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:12,323 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1065 transitions. [2018-10-26 23:15:12,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1065 transitions. [2018-10-26 23:15:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 23:15:12,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:12,328 INFO L375 BasicCegarLoop]: trace histogram [5, 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-10-26 23:15:12,328 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:12,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash -627673409, now seen corresponding path program 1 times [2018-10-26 23:15:12,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:12,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:12,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:12,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 23:15:12,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:12,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:12,450 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:12,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:12,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:12,452 INFO L87 Difference]: Start difference. First operand 752 states and 1065 transitions. Second operand 3 states. [2018-10-26 23:15:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:12,792 INFO L93 Difference]: Finished difference Result 1000 states and 1418 transitions. [2018-10-26 23:15:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:12,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-26 23:15:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:12,797 INFO L225 Difference]: With dead ends: 1000 [2018-10-26 23:15:12,798 INFO L226 Difference]: Without dead ends: 998 [2018-10-26 23:15:12,799 INFO L605 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-10-26 23:15:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-10-26 23:15:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2018-10-26 23:15:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-10-26 23:15:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1416 transitions. [2018-10-26 23:15:12,829 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1416 transitions. Word has length 104 [2018-10-26 23:15:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:12,830 INFO L481 AbstractCegarLoop]: Abstraction has 998 states and 1416 transitions. [2018-10-26 23:15:12,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1416 transitions. [2018-10-26 23:15:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-26 23:15:12,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:12,835 INFO L375 BasicCegarLoop]: trace histogram [8, 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-10-26 23:15:12,835 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:12,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:12,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1947098042, now seen corresponding path program 1 times [2018-10-26 23:15:12,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:12,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 23:15:12,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:12,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:12,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:12,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:12,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:12,978 INFO L87 Difference]: Start difference. First operand 998 states and 1416 transitions. Second operand 3 states. [2018-10-26 23:15:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:14,757 INFO L93 Difference]: Finished difference Result 2192 states and 3160 transitions. [2018-10-26 23:15:14,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:14,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-10-26 23:15:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:14,767 INFO L225 Difference]: With dead ends: 2192 [2018-10-26 23:15:14,767 INFO L226 Difference]: Without dead ends: 1198 [2018-10-26 23:15:14,770 INFO L605 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-10-26 23:15:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-10-26 23:15:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1158. [2018-10-26 23:15:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-10-26 23:15:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1660 transitions. [2018-10-26 23:15:14,805 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1660 transitions. Word has length 162 [2018-10-26 23:15:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:14,806 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1660 transitions. [2018-10-26 23:15:14,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1660 transitions. [2018-10-26 23:15:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 23:15:14,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:14,811 INFO L375 BasicCegarLoop]: trace histogram [9, 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-10-26 23:15:14,811 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:14,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1355334650, now seen corresponding path program 1 times [2018-10-26 23:15:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:14,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:14,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:14,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:14,815 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-26 23:15:14,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:14,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:14,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:14,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:14,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:14,923 INFO L87 Difference]: Start difference. First operand 1158 states and 1660 transitions. Second operand 3 states. [2018-10-26 23:15:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:15,334 INFO L93 Difference]: Finished difference Result 2414 states and 3438 transitions. [2018-10-26 23:15:15,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:15,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-10-26 23:15:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:15,343 INFO L225 Difference]: With dead ends: 2414 [2018-10-26 23:15:15,344 INFO L226 Difference]: Without dead ends: 1268 [2018-10-26 23:15:15,353 INFO L605 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-10-26 23:15:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-10-26 23:15:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1254. [2018-10-26 23:15:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-10-26 23:15:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1776 transitions. [2018-10-26 23:15:15,388 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1776 transitions. Word has length 199 [2018-10-26 23:15:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:15,388 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-10-26 23:15:15,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1776 transitions. [2018-10-26 23:15:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-26 23:15:15,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:15,393 INFO L375 BasicCegarLoop]: trace histogram [10, 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-10-26 23:15:15,395 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:15,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1865787222, now seen corresponding path program 1 times [2018-10-26 23:15:15,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:15,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:15,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:15,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:15,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-10-26 23:15:15,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:15,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:15,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:15,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:15,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:15,530 INFO L87 Difference]: Start difference. First operand 1254 states and 1776 transitions. Second operand 3 states. [2018-10-26 23:15:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:15,770 INFO L93 Difference]: Finished difference Result 2612 states and 3688 transitions. [2018-10-26 23:15:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:15,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-10-26 23:15:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:15,784 INFO L225 Difference]: With dead ends: 2612 [2018-10-26 23:15:15,785 INFO L226 Difference]: Without dead ends: 1370 [2018-10-26 23:15:15,788 INFO L605 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-10-26 23:15:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-10-26 23:15:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1358. [2018-10-26 23:15:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-10-26 23:15:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1900 transitions. [2018-10-26 23:15:15,831 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1900 transitions. Word has length 221 [2018-10-26 23:15:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:15,831 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1900 transitions. [2018-10-26 23:15:15,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1900 transitions. [2018-10-26 23:15:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 23:15:15,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:15,839 INFO L375 BasicCegarLoop]: trace histogram [11, 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-10-26 23:15:15,839 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:15,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash 632408180, now seen corresponding path program 1 times [2018-10-26 23:15:15,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:15,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:15,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-26 23:15:16,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:16,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:16,030 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:16,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:16,032 INFO L87 Difference]: Start difference. First operand 1358 states and 1900 transitions. Second operand 3 states. [2018-10-26 23:15:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:16,604 INFO L93 Difference]: Finished difference Result 2848 states and 3988 transitions. [2018-10-26 23:15:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:16,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-10-26 23:15:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:16,608 INFO L225 Difference]: With dead ends: 2848 [2018-10-26 23:15:16,609 INFO L226 Difference]: Without dead ends: 1502 [2018-10-26 23:15:16,615 INFO L605 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-10-26 23:15:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-26 23:15:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1490. [2018-10-26 23:15:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-10-26 23:15:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2052 transitions. [2018-10-26 23:15:16,651 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2052 transitions. Word has length 246 [2018-10-26 23:15:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:16,652 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 2052 transitions. [2018-10-26 23:15:16,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2052 transitions. [2018-10-26 23:15:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-26 23:15:16,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:16,659 INFO L375 BasicCegarLoop]: trace histogram [11, 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-10-26 23:15:16,660 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:16,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1914580466, now seen corresponding path program 1 times [2018-10-26 23:15:16,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:16,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:16,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-26 23:15:16,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:16,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:16,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:16,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:16,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:16,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:16,815 INFO L87 Difference]: Start difference. First operand 1490 states and 2052 transitions. Second operand 3 states. [2018-10-26 23:15:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:17,375 INFO L93 Difference]: Finished difference Result 3088 states and 4248 transitions. [2018-10-26 23:15:17,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:17,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-10-26 23:15:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:17,384 INFO L225 Difference]: With dead ends: 3088 [2018-10-26 23:15:17,385 INFO L226 Difference]: Without dead ends: 1610 [2018-10-26 23:15:17,388 INFO L605 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-10-26 23:15:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2018-10-26 23:15:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1602. [2018-10-26 23:15:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-10-26 23:15:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2184 transitions. [2018-10-26 23:15:17,427 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2184 transitions. Word has length 246 [2018-10-26 23:15:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:17,428 INFO L481 AbstractCegarLoop]: Abstraction has 1602 states and 2184 transitions. [2018-10-26 23:15:17,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2184 transitions. [2018-10-26 23:15:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-26 23:15:17,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:17,435 INFO L375 BasicCegarLoop]: trace histogram [12, 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-10-26 23:15:17,436 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:17,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash 348301561, now seen corresponding path program 1 times [2018-10-26 23:15:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:17,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:17,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-26 23:15:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:17,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:17,586 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:17,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:17,589 INFO L87 Difference]: Start difference. First operand 1602 states and 2184 transitions. Second operand 3 states. [2018-10-26 23:15:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:17,737 INFO L93 Difference]: Finished difference Result 4778 states and 6516 transitions. [2018-10-26 23:15:17,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:17,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-10-26 23:15:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:17,750 INFO L225 Difference]: With dead ends: 4778 [2018-10-26 23:15:17,750 INFO L226 Difference]: Without dead ends: 3188 [2018-10-26 23:15:17,754 INFO L605 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-10-26 23:15:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-10-26 23:15:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-10-26 23:15:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-10-26 23:15:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4343 transitions. [2018-10-26 23:15:17,823 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4343 transitions. Word has length 277 [2018-10-26 23:15:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:17,824 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 4343 transitions. [2018-10-26 23:15:17,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4343 transitions. [2018-10-26 23:15:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-26 23:15:17,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:17,834 INFO L375 BasicCegarLoop]: trace histogram [12, 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-10-26 23:15:17,834 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:17,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash -933870725, now seen corresponding path program 1 times [2018-10-26 23:15:17,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:17,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:17,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-10-26 23:15:18,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:18,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:18,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:18,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:18,004 INFO L87 Difference]: Start difference. First operand 3186 states and 4343 transitions. Second operand 3 states. [2018-10-26 23:15:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:18,311 INFO L93 Difference]: Finished difference Result 6668 states and 9122 transitions. [2018-10-26 23:15:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:18,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-10-26 23:15:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:18,326 INFO L225 Difference]: With dead ends: 6668 [2018-10-26 23:15:18,326 INFO L226 Difference]: Without dead ends: 3494 [2018-10-26 23:15:18,332 INFO L605 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-10-26 23:15:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2018-10-26 23:15:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3478. [2018-10-26 23:15:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3478 states. [2018-10-26 23:15:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4675 transitions. [2018-10-26 23:15:18,404 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4675 transitions. Word has length 277 [2018-10-26 23:15:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:18,405 INFO L481 AbstractCegarLoop]: Abstraction has 3478 states and 4675 transitions. [2018-10-26 23:15:18,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4675 transitions. [2018-10-26 23:15:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-26 23:15:18,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:18,415 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 23:15:18,416 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:18,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1451193500, now seen corresponding path program 1 times [2018-10-26 23:15:18,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:18,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:18,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:18,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:18,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1178 backedges. 686 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-10-26 23:15:18,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:18,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:18,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:18,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:18,567 INFO L87 Difference]: Start difference. First operand 3478 states and 4675 transitions. Second operand 3 states. [2018-10-26 23:15:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:19,387 INFO L93 Difference]: Finished difference Result 7096 states and 9550 transitions. [2018-10-26 23:15:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:19,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-10-26 23:15:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:19,402 INFO L225 Difference]: With dead ends: 7096 [2018-10-26 23:15:19,403 INFO L226 Difference]: Without dead ends: 3630 [2018-10-26 23:15:19,409 INFO L605 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-10-26 23:15:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2018-10-26 23:15:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3614. [2018-10-26 23:15:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2018-10-26 23:15:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4831 transitions. [2018-10-26 23:15:19,491 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4831 transitions. Word has length 302 [2018-10-26 23:15:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:19,491 INFO L481 AbstractCegarLoop]: Abstraction has 3614 states and 4831 transitions. [2018-10-26 23:15:19,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4831 transitions. [2018-10-26 23:15:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-26 23:15:19,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:19,503 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 23:15:19,503 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash -701605104, now seen corresponding path program 1 times [2018-10-26 23:15:19,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:19,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:19,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-10-26 23:15:19,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:19,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:19,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:19,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:19,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:19,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:19,642 INFO L87 Difference]: Start difference. First operand 3614 states and 4831 transitions. Second operand 3 states. [2018-10-26 23:15:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:19,874 INFO L93 Difference]: Finished difference Result 7624 states and 10326 transitions. [2018-10-26 23:15:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:19,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-10-26 23:15:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:19,889 INFO L225 Difference]: With dead ends: 7624 [2018-10-26 23:15:19,889 INFO L226 Difference]: Without dead ends: 4022 [2018-10-26 23:15:19,896 INFO L605 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-10-26 23:15:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2018-10-26 23:15:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3934. [2018-10-26 23:15:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3934 states. [2018-10-26 23:15:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 5207 transitions. [2018-10-26 23:15:20,011 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 5207 transitions. Word has length 313 [2018-10-26 23:15:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:20,012 INFO L481 AbstractCegarLoop]: Abstraction has 3934 states and 5207 transitions. [2018-10-26 23:15:20,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 5207 transitions. [2018-10-26 23:15:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-26 23:15:20,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:20,021 INFO L375 BasicCegarLoop]: trace histogram [14, 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-10-26 23:15:20,021 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:20,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2061615233, now seen corresponding path program 1 times [2018-10-26 23:15:20,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:20,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:20,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-10-26 23:15:20,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:20,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:20,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:20,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:20,183 INFO L87 Difference]: Start difference. First operand 3934 states and 5207 transitions. Second operand 3 states. [2018-10-26 23:15:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:21,920 INFO L93 Difference]: Finished difference Result 8272 states and 10886 transitions. [2018-10-26 23:15:21,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:21,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-10-26 23:15:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:21,950 INFO L225 Difference]: With dead ends: 8272 [2018-10-26 23:15:21,956 INFO L226 Difference]: Without dead ends: 4350 [2018-10-26 23:15:21,962 INFO L605 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-10-26 23:15:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2018-10-26 23:15:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4062. [2018-10-26 23:15:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2018-10-26 23:15:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5359 transitions. [2018-10-26 23:15:22,046 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5359 transitions. Word has length 328 [2018-10-26 23:15:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:22,047 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 5359 transitions. [2018-10-26 23:15:22,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5359 transitions. [2018-10-26 23:15:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-26 23:15:22,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:22,057 INFO L375 BasicCegarLoop]: trace histogram [14, 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-10-26 23:15:22,057 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:22,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash -752269920, now seen corresponding path program 1 times [2018-10-26 23:15:22,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:22,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:22,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-10-26 23:15:22,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:22,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:22,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:22,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:22,266 INFO L87 Difference]: Start difference. First operand 4062 states and 5359 transitions. Second operand 3 states. [2018-10-26 23:15:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:22,474 INFO L93 Difference]: Finished difference Result 11642 states and 15437 transitions. [2018-10-26 23:15:22,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:22,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-10-26 23:15:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:22,502 INFO L225 Difference]: With dead ends: 11642 [2018-10-26 23:15:22,502 INFO L226 Difference]: Without dead ends: 7592 [2018-10-26 23:15:22,509 INFO L605 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-10-26 23:15:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2018-10-26 23:15:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 7590. [2018-10-26 23:15:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-10-26 23:15:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 10069 transitions. [2018-10-26 23:15:22,648 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 10069 transitions. Word has length 329 [2018-10-26 23:15:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:22,649 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 10069 transitions. [2018-10-26 23:15:22,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 10069 transitions. [2018-10-26 23:15:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-26 23:15:22,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:22,665 INFO L375 BasicCegarLoop]: trace histogram [14, 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-10-26 23:15:22,666 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:22,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1637112346, now seen corresponding path program 1 times [2018-10-26 23:15:22,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:22,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:22,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-10-26 23:15:22,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:15:22,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:15:22,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:22,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:15:22,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:15:22,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:15:22,877 INFO L87 Difference]: Start difference. First operand 7590 states and 10069 transitions. Second operand 3 states. [2018-10-26 23:15:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:23,117 INFO L93 Difference]: Finished difference Result 15176 states and 20114 transitions. [2018-10-26 23:15:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:15:23,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-26 23:15:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:23,144 INFO L225 Difference]: With dead ends: 15176 [2018-10-26 23:15:23,144 INFO L226 Difference]: Without dead ends: 7598 [2018-10-26 23:15:23,155 INFO L605 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-10-26 23:15:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-10-26 23:15:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-10-26 23:15:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-10-26 23:15:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-10-26 23:15:23,291 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 330 [2018-10-26 23:15:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:23,291 INFO L481 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-10-26 23:15:23,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:15:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-10-26 23:15:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-26 23:15:23,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:23,302 INFO L375 BasicCegarLoop]: trace histogram [14, 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-10-26 23:15:23,302 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:23,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1668969407, now seen corresponding path program 1 times [2018-10-26 23:15:23,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:23,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 817 proven. 13 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-10-26 23:15:23,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:15:23,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:15:23,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-10-26 23:15:23,560 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [249], [252], [260], [263], [268], [271], [273], [276], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:15:23,631 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:15:23,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:15:24,761 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:15:24,762 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 114 variables. [2018-10-26 23:15:24,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:24,777 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:15:27,248 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 75.81% of their original sizes. [2018-10-26 23:15:27,248 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:15:29,040 INFO L415 sIntCurrentIteration]: We unified 352 AI predicates to 352 [2018-10-26 23:15:29,040 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:15:29,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:15:29,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-26 23:15:29,041 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:15:29,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:15:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:15:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:15:29,043 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 14 states. [2018-10-26 23:15:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:15:35,592 INFO L93 Difference]: Finished difference Result 15125 states and 19568 transitions. [2018-10-26 23:15:35,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:15:35,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 353 [2018-10-26 23:15:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:15:35,608 INFO L225 Difference]: With dead ends: 15125 [2018-10-26 23:15:35,609 INFO L226 Difference]: Without dead ends: 7571 [2018-10-26 23:15:35,620 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 354 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:15:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2018-10-26 23:15:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7570. [2018-10-26 23:15:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7570 states. [2018-10-26 23:15:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 9793 transitions. [2018-10-26 23:15:35,761 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 9793 transitions. Word has length 353 [2018-10-26 23:15:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:15:35,762 INFO L481 AbstractCegarLoop]: Abstraction has 7570 states and 9793 transitions. [2018-10-26 23:15:35,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:15:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 9793 transitions. [2018-10-26 23:15:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-26 23:15:35,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:15:35,772 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 23:15:35,772 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:15:35,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:15:35,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1483220442, now seen corresponding path program 1 times [2018-10-26 23:15:35,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:15:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:35,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:15:35,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:15:35,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:15:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:15:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 847 proven. 13 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-10-26 23:15:36,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:15:36,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:15:36,040 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-10-26 23:15:36,042 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [273], [276], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:15:36,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:15:36,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:15:37,141 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:18:16,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:18:16,225 INFO L272 AbstractInterpreter]: Visited 112 different actions 3993 times. Merged at 102 different actions 3375 times. Widened at 25 different actions 468 times. Found 488 fixpoints after 35 different actions. Largest state had 116 variables. [2018-10-26 23:18:16,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:16,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:18:16,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:16,234 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/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-10-26 23:18:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:16,257 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:18:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:16,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 847 proven. 13 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-10-26 23:18:16,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:18:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 847 proven. 13 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-10-26 23:18:16,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:18:16,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 23:18:16,623 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:18:16,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:18:16,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:18:16,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:18:16,624 INFO L87 Difference]: Start difference. First operand 7570 states and 9793 transitions. Second operand 4 states. [2018-10-26 23:18:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:18,872 INFO L93 Difference]: Finished difference Result 15046 states and 19463 transitions. [2018-10-26 23:18:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:18:18,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2018-10-26 23:18:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:18,903 INFO L225 Difference]: With dead ends: 15046 [2018-10-26 23:18:18,903 INFO L226 Difference]: Without dead ends: 11348 [2018-10-26 23:18:18,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2018-10-26 23:18:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 8698. [2018-10-26 23:18:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8698 states. [2018-10-26 23:18:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 11313 transitions. [2018-10-26 23:18:19,159 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 11313 transitions. Word has length 367 [2018-10-26 23:18:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:19,160 INFO L481 AbstractCegarLoop]: Abstraction has 8698 states and 11313 transitions. [2018-10-26 23:18:19,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:18:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 11313 transitions. [2018-10-26 23:18:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-26 23:18:19,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:19,177 INFO L375 BasicCegarLoop]: trace histogram [16, 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-10-26 23:18:19,178 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:19,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1666031329, now seen corresponding path program 2 times [2018-10-26 23:18:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:19,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 911 proven. 6 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-10-26 23:18:19,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:19,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:18:19,446 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:18:19,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:18:19,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:19,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:18:19,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:18:19,465 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:18:19,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 23:18:19,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:19,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-10-26 23:18:19,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:18:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-10-26 23:18:20,064 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:18:20,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-10-26 23:18:20,065 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:20,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:18:20,066 INFO L87 Difference]: Start difference. First operand 8698 states and 11313 transitions. Second operand 3 states. [2018-10-26 23:18:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:20,947 INFO L93 Difference]: Finished difference Result 17660 states and 22950 transitions. [2018-10-26 23:18:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:20,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-10-26 23:18:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:20,958 INFO L225 Difference]: With dead ends: 17660 [2018-10-26 23:18:20,958 INFO L226 Difference]: Without dead ends: 8978 [2018-10-26 23:18:20,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:18:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8978 states. [2018-10-26 23:18:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8978 to 8122. [2018-10-26 23:18:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2018-10-26 23:18:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 10161 transitions. [2018-10-26 23:18:21,123 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 10161 transitions. Word has length 381 [2018-10-26 23:18:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:21,123 INFO L481 AbstractCegarLoop]: Abstraction has 8122 states and 10161 transitions. [2018-10-26 23:18:21,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 10161 transitions. [2018-10-26 23:18:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-26 23:18:21,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:21,141 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:21,141 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:21,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1287142549, now seen corresponding path program 1 times [2018-10-26 23:18:21,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:21,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:21,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 23:18:21,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:21,392 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:18:21,392 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-10-26 23:18:21,393 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [260], [263], [268], [271], [273], [276], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:18:21,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:18:21,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:18:22,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:20:50,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:20:50,320 INFO L272 AbstractInterpreter]: Visited 113 different actions 4096 times. Merged at 103 different actions 3441 times. Widened at 25 different actions 469 times. Found 520 fixpoints after 35 different actions. Largest state had 116 variables. [2018-10-26 23:20:50,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:20:50,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:20:50,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:20:50,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/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-10-26 23:20:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:20:50,336 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:20:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:50,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:20:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 23:20:50,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:20:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 23:20:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:20:50,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 23:20:50,778 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:20:50,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:20:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:20:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:20:50,779 INFO L87 Difference]: Start difference. First operand 8122 states and 10161 transitions. Second operand 4 states. [2018-10-26 23:20:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:20:51,036 INFO L93 Difference]: Finished difference Result 18459 states and 22997 transitions. [2018-10-26 23:20:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:20:51,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-10-26 23:20:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:20:51,052 INFO L225 Difference]: With dead ends: 18459 [2018-10-26 23:20:51,052 INFO L226 Difference]: Without dead ends: 10345 [2018-10-26 23:20:51,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:20:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10345 states. [2018-10-26 23:20:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10345 to 8545. [2018-10-26 23:20:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-10-26 23:20:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 10665 transitions. [2018-10-26 23:20:51,214 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 10665 transitions. Word has length 396 [2018-10-26 23:20:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:20:51,214 INFO L481 AbstractCegarLoop]: Abstraction has 8545 states and 10665 transitions. [2018-10-26 23:20:51,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:20:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 10665 transitions. [2018-10-26 23:20:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-26 23:20:51,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:20:51,224 INFO L375 BasicCegarLoop]: trace histogram [18, 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-10-26 23:20:51,224 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:20:51,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:20:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1461293286, now seen corresponding path program 1 times [2018-10-26 23:20:51,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:20:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:20:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:20:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:20:51,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:20:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-10-26 23:20:51,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:20:51,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:20:51,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:20:51,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:20:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:20:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:20:51,390 INFO L87 Difference]: Start difference. First operand 8545 states and 10665 transitions. Second operand 3 states. [2018-10-26 23:20:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:20:51,952 INFO L93 Difference]: Finished difference Result 16121 states and 19736 transitions. [2018-10-26 23:20:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:20:51,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-10-26 23:20:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:20:51,959 INFO L225 Difference]: With dead ends: 16121 [2018-10-26 23:20:51,959 INFO L226 Difference]: Without dead ends: 3939 [2018-10-26 23:20:51,968 INFO L605 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-10-26 23:20:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2018-10-26 23:20:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3721. [2018-10-26 23:20:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2018-10-26 23:20:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4601 transitions. [2018-10-26 23:20:52,028 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4601 transitions. Word has length 436 [2018-10-26 23:20:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:20:52,028 INFO L481 AbstractCegarLoop]: Abstraction has 3721 states and 4601 transitions. [2018-10-26 23:20:52,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:20:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4601 transitions. [2018-10-26 23:20:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-10-26 23:20:52,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:20:52,037 INFO L375 BasicCegarLoop]: trace histogram [19, 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-10-26 23:20:52,038 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:20:52,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:20:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1842796121, now seen corresponding path program 1 times [2018-10-26 23:20:52,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:20:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:20:52,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:20:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:20:52,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:20:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:20:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 1671 proven. 15 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2018-10-26 23:20:52,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:20:52,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:20:52,330 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 522 with the following transitions: [2018-10-26 23:20:52,330 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [273], [276], [284], [287], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:20:52,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:20:52,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:20:53,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:23:20,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:23:20,330 INFO L272 AbstractInterpreter]: Visited 119 different actions 4372 times. Merged at 104 different actions 3643 times. Widened at 22 different actions 513 times. Found 590 fixpoints after 46 different actions. Largest state had 117 variables. [2018-10-26 23:23:20,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:20,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:23:20,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:20,342 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:23:20,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:20,350 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:23:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:20,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:23:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 1105 proven. 0 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-10-26 23:23:20,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:23:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 1105 proven. 0 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-10-26 23:23:20,941 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:23:20,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-10-26 23:23:20,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:23:20,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:23:20,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:23:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:23:20,943 INFO L87 Difference]: Start difference. First operand 3721 states and 4601 transitions. Second operand 3 states. [2018-10-26 23:23:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:21,044 INFO L93 Difference]: Finished difference Result 4170 states and 5123 transitions. [2018-10-26 23:23:21,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:23:21,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 521 [2018-10-26 23:23:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:21,049 INFO L225 Difference]: With dead ends: 4170 [2018-10-26 23:23:21,049 INFO L226 Difference]: Without dead ends: 4090 [2018-10-26 23:23:21,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:23:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2018-10-26 23:23:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3643. [2018-10-26 23:23:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-10-26 23:23:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4505 transitions. [2018-10-26 23:23:21,109 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4505 transitions. Word has length 521 [2018-10-26 23:23:21,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:21,110 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 4505 transitions. [2018-10-26 23:23:21,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:23:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4505 transitions. [2018-10-26 23:23:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-26 23:23:21,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:21,118 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:23:21,118 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:21,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash -541874184, now seen corresponding path program 1 times [2018-10-26 23:23:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:21,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-10-26 23:23:21,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:21,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:21,469 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 636 with the following transitions: [2018-10-26 23:23:21,469 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [273], [276], [284], [287], [291], [293], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:23:21,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:21,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:22,079 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:25:32,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:25:32,040 INFO L272 AbstractInterpreter]: Visited 116 different actions 3760 times. Merged at 104 different actions 3211 times. Widened at 25 different actions 464 times. Found 422 fixpoints after 32 different actions. Largest state had 117 variables. [2018-10-26 23:25:32,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:32,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:25:32,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:25:32,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:25:32,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:32,058 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:25:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:32,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:25:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-10-26 23:25:32,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:25:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-10-26 23:25:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:25:32,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 23:25:32,524 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:25:32,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:32,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:25:32,525 INFO L87 Difference]: Start difference. First operand 3643 states and 4505 transitions. Second operand 4 states. [2018-10-26 23:25:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:32,712 INFO L93 Difference]: Finished difference Result 4529 states and 5600 transitions. [2018-10-26 23:25:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:32,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 635 [2018-10-26 23:25:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:32,714 INFO L225 Difference]: With dead ends: 4529 [2018-10-26 23:25:32,714 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:25:32,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1270 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:25:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:25:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:25:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:25:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:25:32,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 635 [2018-10-26 23:25:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:32,720 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:25:32,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:25:32,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:25:32,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:25:32,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:32,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:33,533 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 457 DAG size of output: 106 [2018-10-26 23:25:34,242 WARN L179 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-10-26 23:25:34,709 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-26 23:25:35,612 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2018-10-26 23:25:35,614 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 23:25:35,614 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 23:25:35,615 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:25:35,615 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L428 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-10-26 23:25:35,615 INFO L425 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-10-26 23:25:35,615 INFO L421 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (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)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0))) [2018-10-26 23:25:35,616 INFO L421 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-10-26 23:25:35,616 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L421 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-10-26 23:25:35,617 INFO L421 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 (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 563) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L108-2(lines 85 575) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-10-26 23:25:35,617 INFO L428 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-10-26 23:25:35,618 INFO L421 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (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) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2))) [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L428 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-10-26 23:25:35,618 INFO L421 ceAbstractionStarter]: At program point L178(lines 174 523) 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 (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-10-26 23:25:35,618 INFO L421 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0))) [2018-10-26 23:25:35,618 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L421 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse1 (= ssl3_connect_~s__state~0 4400)) (.cse3 (= ssl3_connect_~s__state~0 4464)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse8 (not .cse2)) (.cse6 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= 4352 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse14 (<= 4560 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4560)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= ssl3_connect_~s__state~0 4496)) (.cse10 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse4 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse8) (and .cse9 .cse4 .cse2) (and .cse10 .cse1 .cse4 .cse2) (and .cse3 .cse10 .cse2) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse0 .cse11) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse10 .cse5 .cse2) (and (= ssl3_connect_~s__state~0 4416) .cse4 .cse2) (and .cse11 .cse4 .cse2) (and .cse0 .cse9) (<= ssl3_connect_~blastFlag~0 0) (and (= ssl3_connect_~s__state~0 4432) .cse4 .cse2) (and .cse12 .cse10) (and .cse13 .cse4 .cse2) (and .cse0 .cse14 .cse15 .cse8) (and .cse10 .cse2 .cse16) (and .cse10 .cse6 .cse7 .cse2 .cse17) (and .cse12 .cse0 .cse2) (and .cse10 .cse9 .cse2) (and .cse10 .cse14 .cse2 .cse15 .cse17) (and .cse4 .cse2 .cse16) (and .cse10 .cse13 .cse2) (and .cse10 .cse11 .cse2)))) [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L421 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L421 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-10-26 23:25:35,619 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L421 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (<= ssl3_connect_~blastFlag~0 0)) [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-10-26 23:25:35,620 INFO L421 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-10-26 23:25:35,621 INFO L421 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-10-26 23:25:35,621 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-10-26 23:25:35,624 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-10-26 23:25:35,624 INFO L425 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-10-26 23:25:35,624 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-10-26 23:25:35,624 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-10-26 23:25:35,624 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-10-26 23:25:35,624 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-10-26 23:25:35,625 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-10-26 23:25:35,625 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-10-26 23:25:35,625 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-10-26 23:25:35,625 INFO L421 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2018-10-26 23:25:35,625 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-10-26 23:25:35,625 INFO L425 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-10-26 23:25:35,625 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-10-26 23:25:35,627 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-10-26 23:25:35,627 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-10-26 23:25:35,627 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L421 ceAbstractionStarter]: At program point L160(lines 156 529) 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-10-26 23:25:35,628 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L421 ceAbstractionStarter]: At program point L196(lines 192 517) 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 (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-10-26 23:25:35,629 INFO L421 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-10-26 23:25:35,629 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-10-26 23:25:35,630 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-10-26 23:25:35,630 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-10-26 23:25:35,630 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-10-26 23:25:35,630 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-10-26 23:25:35,630 INFO L421 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (= main_~s~0 12292) [2018-10-26 23:25:35,630 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-10-26 23:25:35,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:25:35 BoogieIcfgContainer [2018-10-26 23:25:35,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:25:35,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:25:35,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:25:35,673 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:25:35,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:15:08" (3/4) ... [2018-10-26 23:25:35,680 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 23:25:35,685 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 23:25:35,686 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-26 23:25:35,686 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 23:25:35,696 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-26 23:25:35,701 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 23:25:35,702 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 23:25:35,727 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) [2018-10-26 23:25:35,727 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || blastFlag <= 0 [2018-10-26 23:25:35,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 23:25:35,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) [2018-10-26 23:25:35,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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)) || !(\old(initial_state) == 12292)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 23:25:35,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 23:25:35,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292) [2018-10-26 23:25:35,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (blastFlag <= 2 && s__state == 4512)) || !(\old(initial_state) == 12292)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || blastFlag <= 0) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((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 <= 3 && blastFlag <= 2) && s__hit == 0)) || ((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 <= 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) [2018-10-26 23:25:35,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 23:25:35,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-10-26 23:25:35,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-10-26 23:25:35,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 23:25:35,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292) [2018-10-26 23:25:35,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) [2018-10-26 23:25:35,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 23:25:35,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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))) || !(\old(initial_state) == 12292)) || (blastFlag <= 0 && 4560 <= s__state) [2018-10-26 23:25:35,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(initial_state) == 12292) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) [2018-10-26 23:25:35,803 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0f33f8b-4fb3-41ad-8ea4-046a36590680/bin-2019/utaipan/witness.graphml [2018-10-26 23:25:35,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:25:35,804 INFO L168 Benchmark]: Toolchain (without parser) took 629477.17 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 958.6 MB in the beginning and 1.4 GB in the end (delta: -444.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,805 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:25:35,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.39 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 942.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,808 INFO L168 Benchmark]: Boogie Preprocessor took 120.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,809 INFO L168 Benchmark]: RCFGBuilder took 1328.70 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,809 INFO L168 Benchmark]: TraceAbstraction took 627491.13 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -315.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,809 INFO L168 Benchmark]: Witness Printer took 130.78 ms. Allocated memory is still 5.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2018-10-26 23:25:35,813 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.39 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 942.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1328.70 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: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 627491.13 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -315.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 130.78 ms. Allocated memory is still 5.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. 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: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((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))) || !(\old(initial_state) == 12292)) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((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)) || !(\old(initial_state) == 12292)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && 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) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || ((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: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (blastFlag <= 2 && s__state == 4512)) || !(\old(initial_state) == 12292)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || blastFlag <= 0) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((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 <= 3 && blastFlag <= 2) && s__hit == 0)) || ((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 <= 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) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((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, 139 locations, 1 error locations. SAFE Result, 627.3s OverallTime, 27 OverallIterations, 21 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 5636 SDtfs, 1934 SDslu, 3555 SDs, 0 SdLazy, 2787 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 5038 GetRequests, 4981 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8698occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 588.9s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9948913476874008 AbsIntWeakeningRatio, 0.4460227272727273 AbsIntAvgWeakeningVarsNumRemoved, 411.65340909090907 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 6572 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 27745 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3389 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 9184 NumberOfCodeBlocks, 8905 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 11447 ConstructedInterpolants, 0 QuantifiedInterpolants, 6733523 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3737 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 37 InterpolantComputations, 25 PerfectInterpolantSequences, 50952/51088 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...