./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba2b941566e2fb2ae010597707522fdb9036fd8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:23:34,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:23:34,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:23:34,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:23:34,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:23:34,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:23:34,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:23:34,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:23:34,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:23:34,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:23:34,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:23:34,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:23:34,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:23:34,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:23:34,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:23:34,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:23:34,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:23:34,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:23:34,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:23:34,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:23:34,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:23:34,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:23:34,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:23:34,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:23:34,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:23:34,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:23:34,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:23:34,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:23:34,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:23:34,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:23:34,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:23:34,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:23:34,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:23:34,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:23:34,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:23:34,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:23:34,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:23:34,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:23:34,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:23:34,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:23:34,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:23:34,780 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:23:34,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:23:34,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:23:34,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:23:34,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:23:34,793 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:23:34,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:23:34,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:23:34,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:23:34,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:23:34,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:23:34,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:23:34,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:23:34,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:23:34,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:23:34,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:23:34,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:23:34,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:23:34,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:23:34,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:23:34,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:23:34,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:23:34,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:23:34,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:23:34,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:23:34,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:23:34,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:23:34,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:23:34,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:23:34,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:23:34,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eba2b941566e2fb2ae010597707522fdb9036fd8 [2019-12-07 16:23:34,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:23:34,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:23:34,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:23:34,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:23:34,912 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:23:34,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-12-07 16:23:34,953 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/data/7bfe2d896/252af82c771040048a35dc245b7b57fe/FLAG2f10eb630 [2019-12-07 16:23:35,296 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:23:35,296 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-12-07 16:23:35,304 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/data/7bfe2d896/252af82c771040048a35dc245b7b57fe/FLAG2f10eb630 [2019-12-07 16:23:35,312 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/data/7bfe2d896/252af82c771040048a35dc245b7b57fe [2019-12-07 16:23:35,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:23:35,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:23:35,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:23:35,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:23:35,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:23:35,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6342ce07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35, skipping insertion in model container [2019-12-07 16:23:35,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:23:35,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:23:35,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:23:35,527 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:23:35,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:23:35,573 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:23:35,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35 WrapperNode [2019-12-07 16:23:35,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:23:35,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:23:35,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:23:35,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:23:35,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:23:35,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:23:35,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:23:35,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:23:35,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... [2019-12-07 16:23:35,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:23:35,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:23:35,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:23:35,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:23:35,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:23:35,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:23:35,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:23:35,745 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:23:36,094 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 16:23:36,095 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 16:23:36,095 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:23:36,096 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 16:23:36,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:23:36 BoogieIcfgContainer [2019-12-07 16:23:36,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:23:36,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:23:36,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:23:36,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:23:36,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:23:35" (1/3) ... [2019-12-07 16:23:36,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fb079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:23:36, skipping insertion in model container [2019-12-07 16:23:36,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:23:35" (2/3) ... [2019-12-07 16:23:36,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fb079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:23:36, skipping insertion in model container [2019-12-07 16:23:36,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:23:36" (3/3) ... [2019-12-07 16:23:36,101 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-12-07 16:23:36,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:23:36,111 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:23:36,118 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:23:36,134 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:23:36,134 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:23:36,134 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:23:36,134 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:23:36,134 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:23:36,135 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:23:36,135 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:23:36,135 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:23:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-12-07 16:23:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 16:23:36,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:36,153 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:36,153 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:36,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2019-12-07 16:23:36,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:36,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977335632] [2019-12-07 16:23:36,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:36,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977335632] [2019-12-07 16:23:36,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:36,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:36,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907754821] [2019-12-07 16:23:36,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:36,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,321 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-12-07 16:23:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:36,479 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-12-07 16:23:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:36,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 16:23:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:36,490 INFO L225 Difference]: With dead ends: 332 [2019-12-07 16:23:36,490 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 16:23:36,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 16:23:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-12-07 16:23:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 16:23:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-12-07 16:23:36,529 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-12-07 16:23:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:36,529 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-12-07 16:23:36,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-12-07 16:23:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 16:23:36,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:36,531 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:36,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2019-12-07 16:23:36,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:36,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853597844] [2019-12-07 16:23:36,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:36,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853597844] [2019-12-07 16:23:36,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:36,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:36,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502661896] [2019-12-07 16:23:36,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:36,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:36,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,582 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-12-07 16:23:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:36,713 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-12-07 16:23:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:36,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 16:23:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:36,715 INFO L225 Difference]: With dead ends: 384 [2019-12-07 16:23:36,716 INFO L226 Difference]: Without dead ends: 218 [2019-12-07 16:23:36,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-12-07 16:23:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-12-07 16:23:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 16:23:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-12-07 16:23:36,733 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-12-07 16:23:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:36,734 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-12-07 16:23:36,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-12-07 16:23:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 16:23:36,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:36,737 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 16:23:36,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2019-12-07 16:23:36,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:36,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727735947] [2019-12-07 16:23:36,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:36,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727735947] [2019-12-07 16:23:36,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:36,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:36,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379348332] [2019-12-07 16:23:36,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:36,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,796 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-12-07 16:23:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:36,903 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-12-07 16:23:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:36,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-07 16:23:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:36,906 INFO L225 Difference]: With dead ends: 448 [2019-12-07 16:23:36,906 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 16:23:36,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 16:23:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-12-07 16:23:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 16:23:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-12-07 16:23:36,922 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-12-07 16:23:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:36,923 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-12-07 16:23:36,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-12-07 16:23:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 16:23:36,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:36,925 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:36,925 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2019-12-07 16:23:36,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:36,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569697098] [2019-12-07 16:23:36,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:36,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569697098] [2019-12-07 16:23:36,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:36,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:36,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220485395] [2019-12-07 16:23:36,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:36,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:36,978 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-12-07 16:23:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,096 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-12-07 16:23:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 16:23:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,099 INFO L225 Difference]: With dead ends: 525 [2019-12-07 16:23:37,099 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 16:23:37,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 16:23:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-12-07 16:23:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 16:23:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-12-07 16:23:37,110 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-12-07 16:23:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,110 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-12-07 16:23:37,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-12-07 16:23:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:23:37,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,112 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 16:23:37,112 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2019-12-07 16:23:37,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16732459] [2019-12-07 16:23:37,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:23:37,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16732459] [2019-12-07 16:23:37,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950289855] [2019-12-07 16:23:37,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,144 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-12-07 16:23:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,212 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-12-07 16:23:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 16:23:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,214 INFO L225 Difference]: With dead ends: 580 [2019-12-07 16:23:37,214 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 16:23:37,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 16:23:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-12-07 16:23:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-07 16:23:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-12-07 16:23:37,222 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-12-07 16:23:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,222 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-12-07 16:23:37,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-12-07 16:23:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:23:37,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,223 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:37,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2019-12-07 16:23:37,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139517582] [2019-12-07 16:23:37,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:23:37,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139517582] [2019-12-07 16:23:37,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217950029] [2019-12-07 16:23:37,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,255 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-12-07 16:23:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,353 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-12-07 16:23:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 16:23:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,355 INFO L225 Difference]: With dead ends: 597 [2019-12-07 16:23:37,355 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 16:23:37,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 16:23:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-12-07 16:23:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 16:23:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-12-07 16:23:37,365 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-12-07 16:23:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,365 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-12-07 16:23:37,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-12-07 16:23:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 16:23:37,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,367 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:37,367 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2019-12-07 16:23:37,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391026730] [2019-12-07 16:23:37,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:23:37,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391026730] [2019-12-07 16:23:37,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253533587] [2019-12-07 16:23:37,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,396 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-12-07 16:23:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,473 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-12-07 16:23:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 16:23:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,475 INFO L225 Difference]: With dead ends: 591 [2019-12-07 16:23:37,475 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 16:23:37,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 16:23:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-12-07 16:23:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 16:23:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-12-07 16:23:37,482 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-12-07 16:23:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,482 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-12-07 16:23:37,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-12-07 16:23:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:23:37,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,483 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-12-07 16:23:37,484 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2019-12-07 16:23:37,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588051487] [2019-12-07 16:23:37,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 16:23:37,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588051487] [2019-12-07 16:23:37,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449285838] [2019-12-07 16:23:37,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,511 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-12-07 16:23:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,583 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-12-07 16:23:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 16:23:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,585 INFO L225 Difference]: With dead ends: 598 [2019-12-07 16:23:37,585 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 16:23:37,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 16:23:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-12-07 16:23:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-07 16:23:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-12-07 16:23:37,592 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-12-07 16:23:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,592 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-12-07 16:23:37,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-12-07 16:23:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:23:37,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,593 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:37,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2019-12-07 16:23:37,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766926371] [2019-12-07 16:23:37,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:23:37,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766926371] [2019-12-07 16:23:37,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022571591] [2019-12-07 16:23:37,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,623 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-12-07 16:23:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,714 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-12-07 16:23:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 16:23:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,716 INFO L225 Difference]: With dead ends: 638 [2019-12-07 16:23:37,716 INFO L226 Difference]: Without dead ends: 338 [2019-12-07 16:23:37,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-07 16:23:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-12-07 16:23:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-07 16:23:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-12-07 16:23:37,724 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-12-07 16:23:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,724 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-12-07 16:23:37,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-12-07 16:23:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 16:23:37,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,725 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:37,725 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2019-12-07 16:23:37,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870321770] [2019-12-07 16:23:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:23:37,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870321770] [2019-12-07 16:23:37,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365224289] [2019-12-07 16:23:37,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,750 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-12-07 16:23:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,852 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-12-07 16:23:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 16:23:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,854 INFO L225 Difference]: With dead ends: 667 [2019-12-07 16:23:37,854 INFO L226 Difference]: Without dead ends: 338 [2019-12-07 16:23:37,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-07 16:23:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-12-07 16:23:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-07 16:23:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-12-07 16:23:37,862 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-12-07 16:23:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:37,862 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-12-07 16:23:37,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-12-07 16:23:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 16:23:37,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:37,863 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:37,864 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2019-12-07 16:23:37,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:37,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182814586] [2019-12-07 16:23:37,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:23:37,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182814586] [2019-12-07 16:23:37,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:37,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:37,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9249732] [2019-12-07 16:23:37,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:37,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,890 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-12-07 16:23:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:37,989 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-12-07 16:23:37,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:37,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-07 16:23:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:37,992 INFO L225 Difference]: With dead ends: 700 [2019-12-07 16:23:37,992 INFO L226 Difference]: Without dead ends: 371 [2019-12-07 16:23:37,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-07 16:23:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-12-07 16:23:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-07 16:23:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-12-07 16:23:38,005 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-12-07 16:23:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,005 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-12-07 16:23:38,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-12-07 16:23:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 16:23:38,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,007 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:38,007 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2019-12-07 16:23:38,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046784899] [2019-12-07 16:23:38,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:23:38,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046784899] [2019-12-07 16:23:38,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:38,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242972433] [2019-12-07 16:23:38,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,032 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-12-07 16:23:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,132 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-12-07 16:23:38,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-07 16:23:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,135 INFO L225 Difference]: With dead ends: 727 [2019-12-07 16:23:38,135 INFO L226 Difference]: Without dead ends: 371 [2019-12-07 16:23:38,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-07 16:23:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-12-07 16:23:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-07 16:23:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-12-07 16:23:38,148 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-12-07 16:23:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,148 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-12-07 16:23:38,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-12-07 16:23:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 16:23:38,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,150 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 16:23:38,150 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2019-12-07 16:23:38,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510577464] [2019-12-07 16:23:38,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 16:23:38,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510577464] [2019-12-07 16:23:38,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:38,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812154102] [2019-12-07 16:23:38,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,177 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-12-07 16:23:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,267 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-12-07 16:23:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 16:23:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,269 INFO L225 Difference]: With dead ends: 744 [2019-12-07 16:23:38,269 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 16:23:38,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 16:23:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-12-07 16:23:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 16:23:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-12-07 16:23:38,279 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-12-07 16:23:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,279 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-12-07 16:23:38,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-12-07 16:23:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 16:23:38,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,280 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 16:23:38,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2019-12-07 16:23:38,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445083024] [2019-12-07 16:23:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 16:23:38,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445083024] [2019-12-07 16:23:38,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:38,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908335754] [2019-12-07 16:23:38,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,302 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-12-07 16:23:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,395 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-12-07 16:23:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 16:23:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,397 INFO L225 Difference]: With dead ends: 765 [2019-12-07 16:23:38,397 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 16:23:38,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 16:23:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-12-07 16:23:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 16:23:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-12-07 16:23:38,408 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-12-07 16:23:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,408 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-12-07 16:23:38,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-12-07 16:23:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 16:23:38,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,409 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:38,409 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2019-12-07 16:23:38,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814041869] [2019-12-07 16:23:38,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 16:23:38,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814041869] [2019-12-07 16:23:38,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:38,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486417933] [2019-12-07 16:23:38,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,438 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-12-07 16:23:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,475 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-12-07 16:23:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 16:23:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,479 INFO L225 Difference]: With dead ends: 1092 [2019-12-07 16:23:38,479 INFO L226 Difference]: Without dead ends: 715 [2019-12-07 16:23:38,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-07 16:23:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-12-07 16:23:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-07 16:23:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-12-07 16:23:38,497 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-12-07 16:23:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,498 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-12-07 16:23:38,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-12-07 16:23:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 16:23:38,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,499 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:38,499 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,500 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2019-12-07 16:23:38,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948447107] [2019-12-07 16:23:38,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 16:23:38,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948447107] [2019-12-07 16:23:38,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:38,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557761450] [2019-12-07 16:23:38,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,539 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2019-12-07 16:23:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,584 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2019-12-07 16:23:38,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 16:23:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,589 INFO L225 Difference]: With dead ends: 1798 [2019-12-07 16:23:38,589 INFO L226 Difference]: Without dead ends: 1090 [2019-12-07 16:23:38,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-12-07 16:23:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2019-12-07 16:23:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-12-07 16:23:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2019-12-07 16:23:38,627 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2019-12-07 16:23:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,627 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2019-12-07 16:23:38,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2019-12-07 16:23:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 16:23:38,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,629 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:38,629 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2019-12-07 16:23:38,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143044349] [2019-12-07 16:23:38,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 16:23:38,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143044349] [2019-12-07 16:23:38,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:38,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580250147] [2019-12-07 16:23:38,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,659 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2019-12-07 16:23:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,790 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2019-12-07 16:23:38,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 16:23:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,795 INFO L225 Difference]: With dead ends: 2299 [2019-12-07 16:23:38,795 INFO L226 Difference]: Without dead ends: 1216 [2019-12-07 16:23:38,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-12-07 16:23:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2019-12-07 16:23:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-12-07 16:23:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2019-12-07 16:23:38,822 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2019-12-07 16:23:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:38,822 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2019-12-07 16:23:38,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2019-12-07 16:23:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 16:23:38,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:38,824 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:38,824 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2019-12-07 16:23:38,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:38,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606459099] [2019-12-07 16:23:38,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 16:23:38,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606459099] [2019-12-07 16:23:38,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:38,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:38,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466137589] [2019-12-07 16:23:38,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:38,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,849 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2019-12-07 16:23:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:38,973 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2019-12-07 16:23:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:38,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 16:23:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:38,980 INFO L225 Difference]: With dead ends: 2413 [2019-12-07 16:23:38,980 INFO L226 Difference]: Without dead ends: 1210 [2019-12-07 16:23:38,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-12-07 16:23:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2019-12-07 16:23:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-12-07 16:23:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2019-12-07 16:23:39,019 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2019-12-07 16:23:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:39,020 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2019-12-07 16:23:39,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2019-12-07 16:23:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 16:23:39,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:39,023 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 16:23:39,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2019-12-07 16:23:39,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:39,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377507364] [2019-12-07 16:23:39,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 16:23:39,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377507364] [2019-12-07 16:23:39,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:39,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:39,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364938476] [2019-12-07 16:23:39,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:39,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:39,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:39,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,063 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2019-12-07 16:23:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:39,173 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2019-12-07 16:23:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:39,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-12-07 16:23:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:39,178 INFO L225 Difference]: With dead ends: 2503 [2019-12-07 16:23:39,178 INFO L226 Difference]: Without dead ends: 1312 [2019-12-07 16:23:39,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-12-07 16:23:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2019-12-07 16:23:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-12-07 16:23:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2019-12-07 16:23:39,206 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2019-12-07 16:23:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:39,206 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2019-12-07 16:23:39,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2019-12-07 16:23:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 16:23:39,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:39,208 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 16:23:39,208 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:39,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2019-12-07 16:23:39,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:39,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354314969] [2019-12-07 16:23:39,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 16:23:39,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354314969] [2019-12-07 16:23:39,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:39,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:39,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91423012] [2019-12-07 16:23:39,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:39,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:39,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,237 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2019-12-07 16:23:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:39,368 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2019-12-07 16:23:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:39,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 16:23:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:39,373 INFO L225 Difference]: With dead ends: 2611 [2019-12-07 16:23:39,373 INFO L226 Difference]: Without dead ends: 1306 [2019-12-07 16:23:39,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-12-07 16:23:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2019-12-07 16:23:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-07 16:23:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2019-12-07 16:23:39,401 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2019-12-07 16:23:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:39,401 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2019-12-07 16:23:39,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2019-12-07 16:23:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 16:23:39,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:39,403 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 16:23:39,403 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2019-12-07 16:23:39,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:39,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783117731] [2019-12-07 16:23:39,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 16:23:39,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783117731] [2019-12-07 16:23:39,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:39,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:39,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401026261] [2019-12-07 16:23:39,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:39,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,438 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2019-12-07 16:23:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:39,549 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2019-12-07 16:23:39,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:39,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 16:23:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:39,554 INFO L225 Difference]: With dead ends: 2701 [2019-12-07 16:23:39,554 INFO L226 Difference]: Without dead ends: 1408 [2019-12-07 16:23:39,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-12-07 16:23:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2019-12-07 16:23:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-07 16:23:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-12-07 16:23:39,584 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2019-12-07 16:23:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:39,584 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-12-07 16:23:39,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-12-07 16:23:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 16:23:39,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:39,586 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 16:23:39,587 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:39,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2019-12-07 16:23:39,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:39,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473127073] [2019-12-07 16:23:39,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 16:23:39,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473127073] [2019-12-07 16:23:39,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:39,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:39,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954874881] [2019-12-07 16:23:39,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:39,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,620 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2019-12-07 16:23:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:39,741 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2019-12-07 16:23:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:39,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-12-07 16:23:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:39,749 INFO L225 Difference]: With dead ends: 2803 [2019-12-07 16:23:39,749 INFO L226 Difference]: Without dead ends: 1402 [2019-12-07 16:23:39,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-07 16:23:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2019-12-07 16:23:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-12-07 16:23:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2019-12-07 16:23:39,790 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2019-12-07 16:23:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:39,791 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2019-12-07 16:23:39,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2019-12-07 16:23:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-12-07 16:23:39,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:39,793 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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, 1, 1] [2019-12-07 16:23:39,793 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:39,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2019-12-07 16:23:39,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:39,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918210721] [2019-12-07 16:23:39,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 16:23:39,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918210721] [2019-12-07 16:23:39,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:39,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:39,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608015811] [2019-12-07 16:23:39,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:39,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,838 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2019-12-07 16:23:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:39,963 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2019-12-07 16:23:39,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:39,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-12-07 16:23:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:39,969 INFO L225 Difference]: With dead ends: 2899 [2019-12-07 16:23:39,969 INFO L226 Difference]: Without dead ends: 1510 [2019-12-07 16:23:39,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-12-07 16:23:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-12-07 16:23:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-07 16:23:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2019-12-07 16:23:40,020 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2019-12-07 16:23:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:40,021 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2019-12-07 16:23:40,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2019-12-07 16:23:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-12-07 16:23:40,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:40,024 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 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, 1, 1] [2019-12-07 16:23:40,024 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:40,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:40,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2019-12-07 16:23:40,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:40,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276780658] [2019-12-07 16:23:40,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 16:23:40,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276780658] [2019-12-07 16:23:40,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:40,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:40,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142504028] [2019-12-07 16:23:40,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:40,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,072 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2019-12-07 16:23:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:40,176 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2019-12-07 16:23:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:40,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-12-07 16:23:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:40,182 INFO L225 Difference]: With dead ends: 2974 [2019-12-07 16:23:40,182 INFO L226 Difference]: Without dead ends: 1510 [2019-12-07 16:23:40,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-12-07 16:23:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-12-07 16:23:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-07 16:23:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2019-12-07 16:23:40,215 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2019-12-07 16:23:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:40,215 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2019-12-07 16:23:40,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2019-12-07 16:23:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-07 16:23:40,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:40,218 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 16:23:40,218 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2019-12-07 16:23:40,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:40,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831717592] [2019-12-07 16:23:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 16:23:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831717592] [2019-12-07 16:23:40,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:40,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:40,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603875743] [2019-12-07 16:23:40,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:40,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,257 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2019-12-07 16:23:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:40,372 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2019-12-07 16:23:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:40,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-12-07 16:23:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:40,380 INFO L225 Difference]: With dead ends: 2947 [2019-12-07 16:23:40,380 INFO L226 Difference]: Without dead ends: 1483 [2019-12-07 16:23:40,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2019-12-07 16:23:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2019-12-07 16:23:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-07 16:23:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2019-12-07 16:23:40,426 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2019-12-07 16:23:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:40,426 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2019-12-07 16:23:40,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2019-12-07 16:23:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 16:23:40,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:40,429 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-12-07 16:23:40,430 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2019-12-07 16:23:40,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:40,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947408654] [2019-12-07 16:23:40,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 16:23:40,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947408654] [2019-12-07 16:23:40,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:40,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:40,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477147944] [2019-12-07 16:23:40,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:40,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,471 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2019-12-07 16:23:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:40,590 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2019-12-07 16:23:40,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:40,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-12-07 16:23:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:40,598 INFO L225 Difference]: With dead ends: 2947 [2019-12-07 16:23:40,598 INFO L226 Difference]: Without dead ends: 1456 [2019-12-07 16:23:40,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-12-07 16:23:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2019-12-07 16:23:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-07 16:23:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2019-12-07 16:23:40,653 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2019-12-07 16:23:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:40,653 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2019-12-07 16:23:40,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2019-12-07 16:23:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-07 16:23:40,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:40,658 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:40,658 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2019-12-07 16:23:40,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:40,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949154540] [2019-12-07 16:23:40,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 16:23:40,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949154540] [2019-12-07 16:23:40,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:40,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:40,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810785400] [2019-12-07 16:23:40,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:40,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:40,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:40,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,699 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2019-12-07 16:23:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:40,803 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2019-12-07 16:23:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:40,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-12-07 16:23:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:40,809 INFO L225 Difference]: With dead ends: 2962 [2019-12-07 16:23:40,809 INFO L226 Difference]: Without dead ends: 1525 [2019-12-07 16:23:40,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-12-07 16:23:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2019-12-07 16:23:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-07 16:23:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2019-12-07 16:23:40,842 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2019-12-07 16:23:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:40,842 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2019-12-07 16:23:40,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2019-12-07 16:23:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-12-07 16:23:40,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:40,845 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:40,845 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:40,846 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2019-12-07 16:23:40,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:40,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939135963] [2019-12-07 16:23:40,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 16:23:40,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939135963] [2019-12-07 16:23:40,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:40,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:40,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991803151] [2019-12-07 16:23:40,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:40,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:40,896 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2019-12-07 16:23:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:40,999 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2019-12-07 16:23:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:40,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-12-07 16:23:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:41,004 INFO L225 Difference]: With dead ends: 3031 [2019-12-07 16:23:41,005 INFO L226 Difference]: Without dead ends: 1513 [2019-12-07 16:23:41,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-12-07 16:23:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2019-12-07 16:23:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-12-07 16:23:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2019-12-07 16:23:41,038 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2019-12-07 16:23:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:41,038 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2019-12-07 16:23:41,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2019-12-07 16:23:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-12-07 16:23:41,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:41,040 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:41,041 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2019-12-07 16:23:41,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:41,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979031147] [2019-12-07 16:23:41,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-12-07 16:23:41,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979031147] [2019-12-07 16:23:41,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:41,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:41,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508653946] [2019-12-07 16:23:41,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:41,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,095 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2019-12-07 16:23:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:41,132 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2019-12-07 16:23:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:41,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-12-07 16:23:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:41,138 INFO L225 Difference]: With dead ends: 3052 [2019-12-07 16:23:41,139 INFO L226 Difference]: Without dead ends: 1558 [2019-12-07 16:23:41,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-12-07 16:23:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2019-12-07 16:23:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-12-07 16:23:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2019-12-07 16:23:41,178 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2019-12-07 16:23:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:41,178 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2019-12-07 16:23:41,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2019-12-07 16:23:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-12-07 16:23:41,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:41,181 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:41,181 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:41,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2019-12-07 16:23:41,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:41,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060565107] [2019-12-07 16:23:41,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-12-07 16:23:41,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060565107] [2019-12-07 16:23:41,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:41,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:23:41,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341826103] [2019-12-07 16:23:41,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:41,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,260 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2019-12-07 16:23:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:41,308 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2019-12-07 16:23:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:41,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-12-07 16:23:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:41,311 INFO L225 Difference]: With dead ends: 3142 [2019-12-07 16:23:41,311 INFO L226 Difference]: Without dead ends: 1591 [2019-12-07 16:23:41,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-07 16:23:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2019-12-07 16:23:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-12-07 16:23:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2019-12-07 16:23:41,361 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2019-12-07 16:23:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:41,361 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2019-12-07 16:23:41,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2019-12-07 16:23:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-12-07 16:23:41,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:41,365 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-12-07 16:23:41,365 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:41,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:41,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2019-12-07 16:23:41,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:41,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602484914] [2019-12-07 16:23:41,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-12-07 16:23:41,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602484914] [2019-12-07 16:23:41,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:41,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:41,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216846021] [2019-12-07 16:23:41,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:41,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:41,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,459 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2019-12-07 16:23:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:41,527 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2019-12-07 16:23:41,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:41,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-12-07 16:23:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:41,533 INFO L225 Difference]: With dead ends: 4612 [2019-12-07 16:23:41,533 INFO L226 Difference]: Without dead ends: 3061 [2019-12-07 16:23:41,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-12-07 16:23:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2019-12-07 16:23:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-12-07 16:23:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2019-12-07 16:23:41,618 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2019-12-07 16:23:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:41,618 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2019-12-07 16:23:41,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2019-12-07 16:23:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-12-07 16:23:41,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:41,622 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-12-07 16:23:41,622 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2019-12-07 16:23:41,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:41,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372993570] [2019-12-07 16:23:41,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-12-07 16:23:41,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372993570] [2019-12-07 16:23:41,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:41,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:41,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601657128] [2019-12-07 16:23:41,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:41,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,698 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2019-12-07 16:23:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:41,818 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2019-12-07 16:23:41,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:41,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-12-07 16:23:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:41,820 INFO L225 Difference]: With dead ends: 6291 [2019-12-07 16:23:41,820 INFO L226 Difference]: Without dead ends: 2043 [2019-12-07 16:23:41,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-12-07 16:23:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2019-12-07 16:23:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-12-07 16:23:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2019-12-07 16:23:41,857 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2019-12-07 16:23:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:41,857 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2019-12-07 16:23:41,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2019-12-07 16:23:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-12-07 16:23:41,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:41,860 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:41,860 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:41,861 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2019-12-07 16:23:41,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:41,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769402554] [2019-12-07 16:23:41,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-12-07 16:23:41,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769402554] [2019-12-07 16:23:41,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423307346] [2019-12-07 16:23:41,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:42,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:23:42,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-12-07 16:23:42,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:23:42,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 16:23:42,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134882340] [2019-12-07 16:23:42,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:42,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:23:42,173 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 3 states. [2019-12-07 16:23:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:42,234 INFO L93 Difference]: Finished difference Result 4660 states and 6632 transitions. [2019-12-07 16:23:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:42,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-12-07 16:23:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:42,239 INFO L225 Difference]: With dead ends: 4660 [2019-12-07 16:23:42,239 INFO L226 Difference]: Without dead ends: 2676 [2019-12-07 16:23:42,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:23:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-07 16:23:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2676. [2019-12-07 16:23:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-12-07 16:23:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3798 transitions. [2019-12-07 16:23:42,306 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3798 transitions. Word has length 375 [2019-12-07 16:23:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:42,307 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3798 transitions. [2019-12-07 16:23:42,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3798 transitions. [2019-12-07 16:23:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-12-07 16:23:42,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:42,313 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:42,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:42,514 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash 490258226, now seen corresponding path program 1 times [2019-12-07 16:23:42,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:42,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904441061] [2019-12-07 16:23:42,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-12-07 16:23:42,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904441061] [2019-12-07 16:23:42,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284273465] [2019-12-07 16:23:42,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:42,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:23:42,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-12-07 16:23:42,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:23:42,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 16:23:42,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388445545] [2019-12-07 16:23:42,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:42,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:23:42,938 INFO L87 Difference]: Start difference. First operand 2676 states and 3798 transitions. Second operand 3 states. [2019-12-07 16:23:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:42,971 INFO L93 Difference]: Finished difference Result 2736 states and 3882 transitions. [2019-12-07 16:23:42,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:42,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-12-07 16:23:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:42,974 INFO L225 Difference]: With dead ends: 2736 [2019-12-07 16:23:42,974 INFO L226 Difference]: Without dead ends: 2143 [2019-12-07 16:23:42,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:23:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-12-07 16:23:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2085. [2019-12-07 16:23:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-12-07 16:23:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2968 transitions. [2019-12-07 16:23:43,009 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2968 transitions. Word has length 446 [2019-12-07 16:23:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:43,010 INFO L462 AbstractCegarLoop]: Abstraction has 2085 states and 2968 transitions. [2019-12-07 16:23:43,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2968 transitions. [2019-12-07 16:23:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-12-07 16:23:43,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:43,013 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:43,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:43,214 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash 567159024, now seen corresponding path program 1 times [2019-12-07 16:23:43,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:43,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503167301] [2019-12-07 16:23:43,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-12-07 16:23:43,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503167301] [2019-12-07 16:23:43,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975530101] [2019-12-07 16:23:43,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:43,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:23:43,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-12-07 16:23:43,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:23:43,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 16:23:43,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327772735] [2019-12-07 16:23:43,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:43,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:43,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:43,547 INFO L87 Difference]: Start difference. First operand 2085 states and 2968 transitions. Second operand 4 states. [2019-12-07 16:23:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:43,742 INFO L93 Difference]: Finished difference Result 4343 states and 6173 transitions. [2019-12-07 16:23:43,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:23:43,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2019-12-07 16:23:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:43,745 INFO L225 Difference]: With dead ends: 4343 [2019-12-07 16:23:43,745 INFO L226 Difference]: Without dead ends: 2221 [2019-12-07 16:23:43,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:23:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-12-07 16:23:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1935. [2019-12-07 16:23:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-07 16:23:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-12-07 16:23:43,789 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 446 [2019-12-07 16:23:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:43,789 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-12-07 16:23:43,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-12-07 16:23:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-12-07 16:23:43,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:43,797 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:23:43,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:43,998 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash 260585257, now seen corresponding path program 1 times [2019-12-07 16:23:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:43,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804950717] [2019-12-07 16:23:43,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-12-07 16:23:44,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804950717] [2019-12-07 16:23:44,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271024645] [2019-12-07 16:23:44,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:44,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:23:44,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:23:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-12-07 16:23:44,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:23:44,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 16:23:44,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698595539] [2019-12-07 16:23:44,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:23:44,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:44,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:23:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:23:44,872 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 4 states. [2019-12-07 16:23:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:45,072 INFO L93 Difference]: Finished difference Result 4591 states and 6320 transitions. [2019-12-07 16:23:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:23:45,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-12-07 16:23:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:45,076 INFO L225 Difference]: With dead ends: 4591 [2019-12-07 16:23:45,076 INFO L226 Difference]: Without dead ends: 2601 [2019-12-07 16:23:45,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:23:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-12-07 16:23:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1935. [2019-12-07 16:23:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-07 16:23:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-12-07 16:23:45,129 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 847 [2019-12-07 16:23:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:45,129 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-12-07 16:23:45,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:23:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-12-07 16:23:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-12-07 16:23:45,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:45,141 INFO L410 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:45,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:23:45,341 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2019-12-07 16:23:45,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:45,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048642683] [2019-12-07 16:23:45,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-12-07 16:23:45,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048642683] [2019-12-07 16:23:45,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:45,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:45,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799359580] [2019-12-07 16:23:45,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:45,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:45,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:45,839 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2019-12-07 16:23:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:45,944 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2019-12-07 16:23:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:45,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2019-12-07 16:23:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:45,947 INFO L225 Difference]: With dead ends: 3871 [2019-12-07 16:23:45,947 INFO L226 Difference]: Without dead ends: 1975 [2019-12-07 16:23:45,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-12-07 16:23:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2019-12-07 16:23:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-07 16:23:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2019-12-07 16:23:45,982 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2019-12-07 16:23:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:45,982 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2019-12-07 16:23:45,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2019-12-07 16:23:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-12-07 16:23:45,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:45,989 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:45,989 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2019-12-07 16:23:45,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:45,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336580170] [2019-12-07 16:23:45,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-12-07 16:23:46,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336580170] [2019-12-07 16:23:46,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:46,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:46,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166408185] [2019-12-07 16:23:46,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:46,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:46,593 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2019-12-07 16:23:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:46,695 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2019-12-07 16:23:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:46,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2019-12-07 16:23:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:46,698 INFO L225 Difference]: With dead ends: 3831 [2019-12-07 16:23:46,698 INFO L226 Difference]: Without dead ends: 1935 [2019-12-07 16:23:46,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-07 16:23:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-07 16:23:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-07 16:23:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2019-12-07 16:23:46,732 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2019-12-07 16:23:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:46,732 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2019-12-07 16:23:46,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2019-12-07 16:23:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-12-07 16:23:46,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:46,739 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:46,739 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:46,739 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2019-12-07 16:23:46,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:46,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264814004] [2019-12-07 16:23:46,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-12-07 16:23:47,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264814004] [2019-12-07 16:23:47,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:47,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:47,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095480486] [2019-12-07 16:23:47,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:47,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:47,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:47,255 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2019-12-07 16:23:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:47,337 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2019-12-07 16:23:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:47,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-12-07 16:23:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:47,342 INFO L225 Difference]: With dead ends: 3871 [2019-12-07 16:23:47,342 INFO L226 Difference]: Without dead ends: 1963 [2019-12-07 16:23:47,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-12-07 16:23:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-12-07 16:23:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-07 16:23:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2019-12-07 16:23:47,385 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2019-12-07 16:23:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:47,385 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2019-12-07 16:23:47,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2019-12-07 16:23:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-12-07 16:23:47,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:23:47,393 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:23:47,393 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:23:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:23:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2019-12-07 16:23:47,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:23:47,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565266639] [2019-12-07 16:23:47,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:23:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:23:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-12-07 16:23:47,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565266639] [2019-12-07 16:23:47,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:23:47,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:23:47,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259241527] [2019-12-07 16:23:47,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:23:47,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:23:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:23:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:47,987 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2019-12-07 16:23:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:23:48,067 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2019-12-07 16:23:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:23:48,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-12-07 16:23:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:23:48,068 INFO L225 Difference]: With dead ends: 2491 [2019-12-07 16:23:48,068 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:23:48,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:23:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:23:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:23:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:23:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:23:48,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2019-12-07 16:23:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:23:48,070 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:23:48,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:23:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:23:48,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:23:48,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:23:48,355 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 130 [2019-12-07 16:23:48,553 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 128 [2019-12-07 16:23:48,885 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 16:23:49,146 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 16:23:49,483 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-12-07 16:23:49,638 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-12-07 16:23:49,831 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-12-07 16:23:50,128 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-12-07 16:23:50,799 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-12-07 16:23:51,250 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-12-07 16:23:51,532 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 16:23:51,743 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 16:23:51,953 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-12-07 16:23:52,173 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 16:23:52,432 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-12-07 16:23:52,585 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-12-07 16:23:53,506 WARN L192 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-12-07 16:23:53,631 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 16:23:54,356 WARN L192 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-12-07 16:23:54,882 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 16:23:55,190 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-12-07 16:23:55,389 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 16:23:55,608 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 16:23:56,176 WARN L192 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-12-07 16:23:56,180 INFO L249 CegarLoopResult]: At program point L630(lines 621 632) the Hoare annotation is: true [2019-12-07 16:23:56,180 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-12-07 16:23:56,181 INFO L246 CegarLoopResult]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-12-07 16:23:56,182 INFO L242 CegarLoopResult]: At program point L201(lines 197 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-12-07 16:23:56,182 INFO L242 CegarLoopResult]: At program point L102(lines 101 583) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-12-07 16:23:56,183 INFO L246 CegarLoopResult]: For program point L301(lines 301 308) no Hoare annotation was computed. [2019-12-07 16:23:56,183 INFO L246 CegarLoopResult]: For program point L301-2(lines 301 308) no Hoare annotation was computed. [2019-12-07 16:23:56,183 INFO L246 CegarLoopResult]: For program point L203(lines 203 549) no Hoare annotation was computed. [2019-12-07 16:23:56,183 INFO L246 CegarLoopResult]: For program point L170(lines 170 560) no Hoare annotation was computed. [2019-12-07 16:23:56,184 INFO L246 CegarLoopResult]: For program point L137(lines 137 571) no Hoare annotation was computed. [2019-12-07 16:23:56,184 INFO L246 CegarLoopResult]: For program point L104(lines 104 582) no Hoare annotation was computed. [2019-12-07 16:23:56,184 INFO L246 CegarLoopResult]: For program point L534(lines 534 540) no Hoare annotation was computed. [2019-12-07 16:23:56,184 INFO L246 CegarLoopResult]: For program point L534-1(lines 534 540) no Hoare annotation was computed. [2019-12-07 16:23:56,184 INFO L246 CegarLoopResult]: For program point L336(lines 336 360) no Hoare annotation was computed. [2019-12-07 16:23:56,185 INFO L242 CegarLoopResult]: At program point L204(lines 203 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 16:23:56,185 INFO L242 CegarLoopResult]: At program point L171(lines 167 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse7 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-12-07 16:23:56,186 INFO L242 CegarLoopResult]: At program point L138(lines 134 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse12 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse13 .cse11) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse12 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8 .cse13 .cse11))) [2019-12-07 16:23:56,186 INFO L246 CegarLoopResult]: For program point L271(lines 271 273) no Hoare annotation was computed. [2019-12-07 16:23:56,186 INFO L246 CegarLoopResult]: For program point L271-2(lines 207 546) no Hoare annotation was computed. [2019-12-07 16:23:56,187 INFO L246 CegarLoopResult]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-12-07 16:23:56,187 INFO L246 CegarLoopResult]: For program point L239(lines 239 250) no Hoare annotation was computed. [2019-12-07 16:23:56,187 INFO L242 CegarLoopResult]: At program point L206(lines 205 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 16:23:56,187 INFO L246 CegarLoopResult]: For program point L173(lines 173 559) no Hoare annotation was computed. [2019-12-07 16:23:56,187 INFO L246 CegarLoopResult]: For program point L140(lines 140 570) no Hoare annotation was computed. [2019-12-07 16:23:56,187 INFO L246 CegarLoopResult]: For program point L107(lines 107 581) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L249 CegarLoopResult]: At program point L603(lines 97 604) the Hoare annotation is: true [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L537(lines 537 539) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L340-2(lines 340 344) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-12-07 16:23:56,188 INFO L246 CegarLoopResult]: For program point L374(lines 374 406) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L246 CegarLoopResult]: For program point L176(lines 176 558) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L246 CegarLoopResult]: For program point L143(lines 143 569) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L246 CegarLoopResult]: For program point L110(lines 110 580) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L246 CegarLoopResult]: For program point L474-2(lines 207 546) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L246 CegarLoopResult]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-12-07 16:23:56,189 INFO L242 CegarLoopResult]: At program point L210(lines 104 582) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,190 INFO L242 CegarLoopResult]: At program point L177(lines 173 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,190 INFO L242 CegarLoopResult]: At program point L144(lines 140 570) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,190 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L608(lines 608 610) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L608-2(lines 608 610) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L179(lines 179 557) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L146(lines 146 568) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L113(lines 113 579) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L249 CegarLoopResult]: At program point L611(lines 11 615) the Hoare annotation is: true [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-12-07 16:23:56,191 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L182(lines 182 556) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L149(lines 149 567) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L116(lines 116 578) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L513(lines 513 519) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-12-07 16:23:56,192 INFO L246 CegarLoopResult]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-12-07 16:23:56,193 INFO L246 CegarLoopResult]: For program point L348(lines 348 356) no Hoare annotation was computed. [2019-12-07 16:23:56,193 INFO L242 CegarLoopResult]: At program point L183(lines 179 557) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-12-07 16:23:56,193 INFO L242 CegarLoopResult]: At program point L150(lines 146 568) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,193 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-12-07 16:23:56,194 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-12-07 16:23:56,194 INFO L242 CegarLoopResult]: At program point L547(lines 98 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse4 .cse5 .cse13 .cse14 .cse6))) [2019-12-07 16:23:56,195 INFO L242 CegarLoopResult]: At program point L349(lines 324 367) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,195 INFO L246 CegarLoopResult]: For program point L416(lines 416 418) no Hoare annotation was computed. [2019-12-07 16:23:56,195 INFO L242 CegarLoopResult]: At program point L383(lines 374 406) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,195 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:23:56,195 INFO L246 CegarLoopResult]: For program point L284(lines 284 286) no Hoare annotation was computed. [2019-12-07 16:23:56,196 INFO L246 CegarLoopResult]: For program point L284-2(lines 207 546) no Hoare annotation was computed. [2019-12-07 16:23:56,196 INFO L246 CegarLoopResult]: For program point L185(lines 185 555) no Hoare annotation was computed. [2019-12-07 16:23:56,196 INFO L246 CegarLoopResult]: For program point L152(lines 152 566) no Hoare annotation was computed. [2019-12-07 16:23:56,196 INFO L246 CegarLoopResult]: For program point L119(lines 119 577) no Hoare annotation was computed. [2019-12-07 16:23:56,196 INFO L246 CegarLoopResult]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-12-07 16:23:56,197 INFO L242 CegarLoopResult]: At program point L516-1(lines 207 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-12-07 16:23:56,197 INFO L246 CegarLoopResult]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-12-07 16:23:56,197 INFO L246 CegarLoopResult]: For program point L318(lines 318 322) no Hoare annotation was computed. [2019-12-07 16:23:56,197 INFO L246 CegarLoopResult]: For program point L318-2(lines 207 546) no Hoare annotation was computed. [2019-12-07 16:23:56,197 INFO L242 CegarLoopResult]: At program point L120(lines 116 578) the Hoare annotation is: (let ((.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse11 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse12 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L584(lines 584 600) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L386(lines 386 404) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L188(lines 188 554) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L155(lines 155 565) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L122(lines 122 576) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L89-1(lines 72 614) no Hoare annotation was computed. [2019-12-07 16:23:56,198 INFO L246 CegarLoopResult]: For program point L618(line 618) no Hoare annotation was computed. [2019-12-07 16:23:56,199 INFO L246 CegarLoopResult]: For program point L585(lines 585 599) no Hoare annotation was computed. [2019-12-07 16:23:56,199 INFO L246 CegarLoopResult]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-12-07 16:23:56,199 INFO L242 CegarLoopResult]: At program point L189(lines 185 555) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-12-07 16:23:56,199 INFO L242 CegarLoopResult]: At program point L156(lines 152 566) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,200 INFO L242 CegarLoopResult]: At program point L123(lines 122 576) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L586(lines 586 591) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L586-2(lines 585 599) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L290-2(lines 290 294) no Hoare annotation was computed. [2019-12-07 16:23:56,200 INFO L246 CegarLoopResult]: For program point L191(lines 191 553) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L158(lines 158 564) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L125(lines 125 575) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L588(lines 588 590) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L225(lines 225 232) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L225-2(lines 225 232) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L425(lines 425 433) no Hoare annotation was computed. [2019-12-07 16:23:56,201 INFO L246 CegarLoopResult]: For program point L425-2(lines 425 433) no Hoare annotation was computed. [2019-12-07 16:23:56,202 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 16:23:56,202 INFO L246 CegarLoopResult]: For program point L194(lines 194 552) no Hoare annotation was computed. [2019-12-07 16:23:56,202 INFO L246 CegarLoopResult]: For program point L161(lines 161 563) no Hoare annotation was computed. [2019-12-07 16:23:56,202 INFO L246 CegarLoopResult]: For program point L128(lines 128 574) no Hoare annotation was computed. [2019-12-07 16:23:56,202 INFO L246 CegarLoopResult]: For program point L327(lines 327 366) no Hoare annotation was computed. [2019-12-07 16:23:56,202 INFO L242 CegarLoopResult]: At program point L195(lines 191 553) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-12-07 16:23:56,202 INFO L242 CegarLoopResult]: At program point L162(lines 158 564) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,203 INFO L246 CegarLoopResult]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-12-07 16:23:56,203 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-12-07 16:23:56,203 INFO L242 CegarLoopResult]: At program point L395(lines 386 404) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 16:23:56,203 INFO L246 CegarLoopResult]: For program point L197(lines 197 551) no Hoare annotation was computed. [2019-12-07 16:23:56,203 INFO L246 CegarLoopResult]: For program point L164(lines 164 562) no Hoare annotation was computed. [2019-12-07 16:23:56,203 INFO L246 CegarLoopResult]: For program point L131(lines 131 573) no Hoare annotation was computed. [2019-12-07 16:23:56,204 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse10 .cse12 .cse13 .cse14 .cse15 .cse2 .cse16 .cse4 .cse5 .cse17 .cse18 .cse9) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse17 .cse18))) [2019-12-07 16:23:56,204 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2019-12-07 16:23:56,204 INFO L246 CegarLoopResult]: For program point L330(lines 330 365) no Hoare annotation was computed. [2019-12-07 16:23:56,204 INFO L246 CegarLoopResult]: For program point L330-1(lines 330 365) no Hoare annotation was computed. [2019-12-07 16:23:56,204 INFO L242 CegarLoopResult]: At program point L165(lines 164 562) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not .cse13)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 .cse11 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-12-07 16:23:56,205 INFO L242 CegarLoopResult]: At program point L132(lines 125 575) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse12 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L496-2(lines 207 546) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L331(lines 331 362) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L200(lines 200 550) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L167(lines 167 561) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L134(lines 134 572) no Hoare annotation was computed. [2019-12-07 16:23:56,205 INFO L246 CegarLoopResult]: For program point L101(lines 101 583) no Hoare annotation was computed. [2019-12-07 16:23:56,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:23:56 BoogieIcfgContainer [2019-12-07 16:23:56,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:23:56,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:23:56,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:23:56,253 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:23:56,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:23:36" (3/4) ... [2019-12-07 16:23:56,256 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:23:56,272 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 16:23:56,273 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:23:56,368 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ecdfbee0-0c9d-44cf-a4f1-d8d3a34a660f/bin/uautomizer/witness.graphml [2019-12-07 16:23:56,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:23:56,370 INFO L168 Benchmark]: Toolchain (without parser) took 21054.82 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 945.1 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 331.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:23:56,370 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:23:56,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:23:56,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:23:56,371 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:23:56,371 INFO L168 Benchmark]: RCFGBuilder took 461.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:23:56,372 INFO L168 Benchmark]: TraceAbstraction took 20156.01 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -956.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 16:23:56,372 INFO L168 Benchmark]: Witness Printer took 115.40 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:23:56,373 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -153.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 461.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20156.01 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -956.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 115.40 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 618]: 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: 140]: Loop Invariant Derived loop invariant: ((((((((((((((8448 <= s__state && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((!(s__state == 8448) && 2 == blastFlag) && s__state <= 8448) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((1 == blastFlag && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state <= 3 || (((((((!(s__state == 8577) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593))) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((((((((1 == blastFlag && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((((((0 == blastFlag && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) || (((((((((((((((((((!(s__state == 8657) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((s__state <= 3 || (((((((!(s__state == 8577) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593))) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((((((((1 == blastFlag && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((1 == blastFlag && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((0 == blastFlag && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: SAFE, OverallTime: 11.9s, OverallIterations: 40, TraceHistogramMax: 38, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, HoareTripleCheckerStatistics: 6725 SDtfs, 5197 SDslu, 2367 SDs, 0 SdLazy, 3349 SolverSat, 1340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2211 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4028 HoareAnnotationTreeSize, 28 FomulaSimplifications, 35056 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7529 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 13262 NumberOfCodeBlocks, 13262 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 13218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9177165 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3245 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 86997/87153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...