./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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 3390cf777ba6d866d94c2b2c149d6845705da1dd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:19,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:19,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:19,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:19,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:19,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:19,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:19,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:19,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:19,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:19,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:19,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:19,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:19,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:19,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:19,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:19,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:19,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:19,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:19,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:19,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:19,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:19,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:19,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:19,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:19,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:19,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:19,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:19,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:19,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:19,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:19,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:19,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:19,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:19,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:19,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:19,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:19,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:19,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:19,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:19,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:19,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:19,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:19,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:19,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:19,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:19,741 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:19,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:19,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:19,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:19,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:19,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:19,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:19,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:19,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:19,752 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:19,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:19,753 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:19,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:19,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:19,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:19,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:19,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:19,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:19,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:19,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:19,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:19,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:19,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:19,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:19,755 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/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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 -> 3390cf777ba6d866d94c2b2c149d6845705da1dd [2019-10-22 08:55:19,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:19,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:19,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:19,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:19,805 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:19,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-10-22 08:55:19,855 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/data/23b06107e/3de6da2e5f094f478e8dc27b7a8d47cc/FLAG69f546433 [2019-10-22 08:55:20,253 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:20,264 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-10-22 08:55:20,273 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/data/23b06107e/3de6da2e5f094f478e8dc27b7a8d47cc/FLAG69f546433 [2019-10-22 08:55:20,597 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/data/23b06107e/3de6da2e5f094f478e8dc27b7a8d47cc [2019-10-22 08:55:20,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:20,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:20,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:20,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:20,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:20,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:20" (1/1) ... [2019-10-22 08:55:20,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5768abd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:20, skipping insertion in model container [2019-10-22 08:55:20,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:20" (1/1) ... [2019-10-22 08:55:20,616 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:20,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:20,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:20,930 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:20,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:21,015 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:21,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21 WrapperNode [2019-10-22 08:55:21,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:21,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:21,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:21,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:21,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:21,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:21,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:21,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:21,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... [2019-10-22 08:55:21,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:21,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:21,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:21,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:21,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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-10-22 08:55:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:21,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:21,309 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:55:21,751 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:55:21,751 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:55:21,752 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:21,752 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:55:21,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:21 BoogieIcfgContainer [2019-10-22 08:55:21,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:21,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:21,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:21,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:21,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:20" (1/3) ... [2019-10-22 08:55:21,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2b77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:21, skipping insertion in model container [2019-10-22 08:55:21,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:21" (2/3) ... [2019-10-22 08:55:21,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2b77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:21, skipping insertion in model container [2019-10-22 08:55:21,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:21" (3/3) ... [2019-10-22 08:55:21,760 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-10-22 08:55:21,769 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:21,775 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:55:21,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:55:21,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:21,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:21,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:21,806 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:21,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:21,806 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:21,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:21,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-10-22 08:55:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:55:21,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:21,829 INFO L380 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] [2019-10-22 08:55:21,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707020, now seen corresponding path program 1 times [2019-10-22 08:55:21,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:21,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839924345] [2019-10-22 08:55:21,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:21,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:21,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:22,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839924345] [2019-10-22 08:55:22,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:22,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:22,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393344314] [2019-10-22 08:55:22,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:22,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:22,051 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-10-22 08:55:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:22,351 INFO L93 Difference]: Finished difference Result 338 states and 585 transitions. [2019-10-22 08:55:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:22,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 08:55:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:22,364 INFO L225 Difference]: With dead ends: 338 [2019-10-22 08:55:22,364 INFO L226 Difference]: Without dead ends: 179 [2019-10-22 08:55:22,367 INFO L600 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-10-22 08:55:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-22 08:55:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2019-10-22 08:55:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-22 08:55:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 278 transitions. [2019-10-22 08:55:22,412 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 278 transitions. Word has length 41 [2019-10-22 08:55:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:22,413 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 278 transitions. [2019-10-22 08:55:22,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 278 transitions. [2019-10-22 08:55:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 08:55:22,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:22,414 INFO L380 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] [2019-10-22 08:55:22,415 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716333, now seen corresponding path program 1 times [2019-10-22 08:55:22,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:22,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337655515] [2019-10-22 08:55:22,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:22,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337655515] [2019-10-22 08:55:22,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:22,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:22,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563946101] [2019-10-22 08:55:22,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:22,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:22,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:22,494 INFO L87 Difference]: Start difference. First operand 171 states and 278 transitions. Second operand 3 states. [2019-10-22 08:55:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:22,702 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2019-10-22 08:55:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:22,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-22 08:55:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:22,704 INFO L225 Difference]: With dead ends: 382 [2019-10-22 08:55:22,704 INFO L226 Difference]: Without dead ends: 218 [2019-10-22 08:55:22,706 INFO L600 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-10-22 08:55:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-22 08:55:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-10-22 08:55:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-22 08:55:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-10-22 08:55:22,738 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 42 [2019-10-22 08:55:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:22,738 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-10-22 08:55:22,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-10-22 08:55:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 08:55:22,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:22,740 INFO L380 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] [2019-10-22 08:55:22,741 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1839414983, now seen corresponding path program 1 times [2019-10-22 08:55:22,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:22,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144140888] [2019-10-22 08:55:22,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:22,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:22,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144140888] [2019-10-22 08:55:22,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:22,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:22,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918133234] [2019-10-22 08:55:22,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:22,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:22,835 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-10-22 08:55:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,003 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-10-22 08:55:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:23,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-22 08:55:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,006 INFO L225 Difference]: With dead ends: 444 [2019-10-22 08:55:23,006 INFO L226 Difference]: Without dead ends: 241 [2019-10-22 08:55:23,007 INFO L600 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-10-22 08:55:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-22 08:55:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-10-22 08:55:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-22 08:55:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-10-22 08:55:23,025 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 69 [2019-10-22 08:55:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,026 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-10-22 08:55:23,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-10-22 08:55:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-22 08:55:23,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,029 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:23,029 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1554149248, now seen corresponding path program 1 times [2019-10-22 08:55:23,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071508926] [2019-10-22 08:55:23,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:23,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071508926] [2019-10-22 08:55:23,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:23,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:23,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958280548] [2019-10-22 08:55:23,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:23,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:23,100 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-10-22 08:55:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,265 INFO L93 Difference]: Finished difference Result 513 states and 872 transitions. [2019-10-22 08:55:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:23,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-22 08:55:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,267 INFO L225 Difference]: With dead ends: 513 [2019-10-22 08:55:23,267 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 08:55:23,268 INFO L600 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-10-22 08:55:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 08:55:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-10-22 08:55:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-22 08:55:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 472 transitions. [2019-10-22 08:55:23,295 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 472 transitions. Word has length 74 [2019-10-22 08:55:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,295 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 472 transitions. [2019-10-22 08:55:23,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 472 transitions. [2019-10-22 08:55:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 08:55:23,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,297 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:23,297 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1571310151, now seen corresponding path program 1 times [2019-10-22 08:55:23,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867872394] [2019-10-22 08:55:23,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:23,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867872394] [2019-10-22 08:55:23,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:23,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:23,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151027472] [2019-10-22 08:55:23,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:23,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:23,352 INFO L87 Difference]: Start difference. First operand 277 states and 472 transitions. Second operand 3 states. [2019-10-22 08:55:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,508 INFO L93 Difference]: Finished difference Result 549 states and 935 transitions. [2019-10-22 08:55:23,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:23,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-22 08:55:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,510 INFO L225 Difference]: With dead ends: 549 [2019-10-22 08:55:23,510 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 08:55:23,510 INFO L600 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-10-22 08:55:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 08:55:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-10-22 08:55:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-22 08:55:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 470 transitions. [2019-10-22 08:55:23,537 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 470 transitions. Word has length 75 [2019-10-22 08:55:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,538 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 470 transitions. [2019-10-22 08:55:23,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 470 transitions. [2019-10-22 08:55:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-22 08:55:23,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,540 INFO L380 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] [2019-10-22 08:55:23,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1779493469, now seen corresponding path program 1 times [2019-10-22 08:55:23,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664582294] [2019-10-22 08:55:23,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:23,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664582294] [2019-10-22 08:55:23,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:23,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:23,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639893159] [2019-10-22 08:55:23,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:23,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:23,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:23,584 INFO L87 Difference]: Start difference. First operand 277 states and 470 transitions. Second operand 3 states. [2019-10-22 08:55:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,682 INFO L93 Difference]: Finished difference Result 564 states and 957 transitions. [2019-10-22 08:55:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:23,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-22 08:55:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,684 INFO L225 Difference]: With dead ends: 564 [2019-10-22 08:55:23,684 INFO L226 Difference]: Without dead ends: 294 [2019-10-22 08:55:23,684 INFO L600 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-10-22 08:55:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-22 08:55:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-10-22 08:55:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-22 08:55:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-10-22 08:55:23,693 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 81 [2019-10-22 08:55:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,693 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-10-22 08:55:23,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-10-22 08:55:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:55:23,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,695 INFO L380 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] [2019-10-22 08:55:23,695 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 685947497, now seen corresponding path program 1 times [2019-10-22 08:55:23,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708409385] [2019-10-22 08:55:23,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:23,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708409385] [2019-10-22 08:55:23,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:23,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:23,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836706558] [2019-10-22 08:55:23,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:23,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:23,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:23,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:23,724 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 3 states. [2019-10-22 08:55:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,824 INFO L93 Difference]: Finished difference Result 579 states and 975 transitions. [2019-10-22 08:55:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:23,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-22 08:55:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,826 INFO L225 Difference]: With dead ends: 579 [2019-10-22 08:55:23,826 INFO L226 Difference]: Without dead ends: 294 [2019-10-22 08:55:23,827 INFO L600 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-10-22 08:55:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-22 08:55:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-10-22 08:55:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-22 08:55:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 488 transitions. [2019-10-22 08:55:23,835 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 488 transitions. Word has length 82 [2019-10-22 08:55:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,835 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 488 transitions. [2019-10-22 08:55:23,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 488 transitions. [2019-10-22 08:55:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 08:55:23,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,837 INFO L380 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] [2019-10-22 08:55:23,837 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash -166367862, now seen corresponding path program 1 times [2019-10-22 08:55:23,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752835439] [2019-10-22 08:55:23,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 08:55:23,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752835439] [2019-10-22 08:55:23,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:23,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:23,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226703761] [2019-10-22 08:55:23,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:23,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:23,867 INFO L87 Difference]: Start difference. First operand 292 states and 488 transitions. Second operand 3 states. [2019-10-22 08:55:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:23,961 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2019-10-22 08:55:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:23,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-22 08:55:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:23,963 INFO L225 Difference]: With dead ends: 586 [2019-10-22 08:55:23,963 INFO L226 Difference]: Without dead ends: 301 [2019-10-22 08:55:23,964 INFO L600 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-10-22 08:55:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-22 08:55:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-22 08:55:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-22 08:55:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 494 transitions. [2019-10-22 08:55:23,973 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 494 transitions. Word has length 94 [2019-10-22 08:55:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:23,973 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 494 transitions. [2019-10-22 08:55:23,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 494 transitions. [2019-10-22 08:55:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 08:55:23,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:23,975 INFO L380 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] [2019-10-22 08:55:23,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1087158848, now seen corresponding path program 1 times [2019-10-22 08:55:23,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:23,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462029391] [2019-10-22 08:55:23,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:23,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:24,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462029391] [2019-10-22 08:55:24,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:24,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028591002] [2019-10-22 08:55:24,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:24,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:24,007 INFO L87 Difference]: Start difference. First operand 301 states and 494 transitions. Second operand 3 states. [2019-10-22 08:55:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,126 INFO L93 Difference]: Finished difference Result 626 states and 1030 transitions. [2019-10-22 08:55:24,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:24,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-10-22 08:55:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,128 INFO L225 Difference]: With dead ends: 626 [2019-10-22 08:55:24,128 INFO L226 Difference]: Without dead ends: 332 [2019-10-22 08:55:24,129 INFO L600 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-10-22 08:55:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-22 08:55:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-10-22 08:55:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-22 08:55:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 541 transitions. [2019-10-22 08:55:24,138 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 541 transitions. Word has length 95 [2019-10-22 08:55:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,139 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 541 transitions. [2019-10-22 08:55:24,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 541 transitions. [2019-10-22 08:55:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-22 08:55:24,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,140 INFO L380 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] [2019-10-22 08:55:24,140 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2088595028, now seen corresponding path program 1 times [2019-10-22 08:55:24,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497285569] [2019-10-22 08:55:24,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:24,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497285569] [2019-10-22 08:55:24,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:24,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97878471] [2019-10-22 08:55:24,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:24,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:24,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:24,170 INFO L87 Difference]: Start difference. First operand 330 states and 541 transitions. Second operand 3 states. [2019-10-22 08:55:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,311 INFO L93 Difference]: Finished difference Result 655 states and 1073 transitions. [2019-10-22 08:55:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:24,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-22 08:55:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,312 INFO L225 Difference]: With dead ends: 655 [2019-10-22 08:55:24,312 INFO L226 Difference]: Without dead ends: 332 [2019-10-22 08:55:24,313 INFO L600 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-10-22 08:55:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-22 08:55:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-10-22 08:55:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-22 08:55:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 537 transitions. [2019-10-22 08:55:24,323 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 537 transitions. Word has length 96 [2019-10-22 08:55:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,323 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 537 transitions. [2019-10-22 08:55:24,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 537 transitions. [2019-10-22 08:55:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:55:24,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,325 INFO L380 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] [2019-10-22 08:55:24,325 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2096161680, now seen corresponding path program 1 times [2019-10-22 08:55:24,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41691574] [2019-10-22 08:55:24,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:24,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41691574] [2019-10-22 08:55:24,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:24,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717012855] [2019-10-22 08:55:24,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:24,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:24,354 INFO L87 Difference]: Start difference. First operand 330 states and 537 transitions. Second operand 3 states. [2019-10-22 08:55:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,476 INFO L93 Difference]: Finished difference Result 688 states and 1123 transitions. [2019-10-22 08:55:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:24,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 08:55:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,478 INFO L225 Difference]: With dead ends: 688 [2019-10-22 08:55:24,478 INFO L226 Difference]: Without dead ends: 365 [2019-10-22 08:55:24,478 INFO L600 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-10-22 08:55:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-10-22 08:55:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-10-22 08:55:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-22 08:55:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 579 transitions. [2019-10-22 08:55:24,488 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 579 transitions. Word has length 97 [2019-10-22 08:55:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,488 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 579 transitions. [2019-10-22 08:55:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 579 transitions. [2019-10-22 08:55:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:55:24,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,490 INFO L380 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] [2019-10-22 08:55:24,490 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -297892004, now seen corresponding path program 1 times [2019-10-22 08:55:24,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705593320] [2019-10-22 08:55:24,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:24,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705593320] [2019-10-22 08:55:24,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:24,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501086504] [2019-10-22 08:55:24,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:24,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:24,517 INFO L87 Difference]: Start difference. First operand 357 states and 579 transitions. Second operand 3 states. [2019-10-22 08:55:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,631 INFO L93 Difference]: Finished difference Result 715 states and 1160 transitions. [2019-10-22 08:55:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:24,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 08:55:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,633 INFO L225 Difference]: With dead ends: 715 [2019-10-22 08:55:24,633 INFO L226 Difference]: Without dead ends: 365 [2019-10-22 08:55:24,634 INFO L600 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-10-22 08:55:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-10-22 08:55:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-10-22 08:55:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-22 08:55:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2019-10-22 08:55:24,643 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 98 [2019-10-22 08:55:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,643 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2019-10-22 08:55:24,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2019-10-22 08:55:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 08:55:24,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,644 INFO L380 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:24,645 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 386381809, now seen corresponding path program 1 times [2019-10-22 08:55:24,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79344319] [2019-10-22 08:55:24,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-22 08:55:24,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79344319] [2019-10-22 08:55:24,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:24,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628290972] [2019-10-22 08:55:24,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:24,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:24,673 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand 3 states. [2019-10-22 08:55:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,796 INFO L93 Difference]: Finished difference Result 743 states and 1195 transitions. [2019-10-22 08:55:24,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:24,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 08:55:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,798 INFO L225 Difference]: With dead ends: 743 [2019-10-22 08:55:24,798 INFO L226 Difference]: Without dead ends: 393 [2019-10-22 08:55:24,799 INFO L600 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-10-22 08:55:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-22 08:55:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-10-22 08:55:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-22 08:55:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 627 transitions. [2019-10-22 08:55:24,809 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 627 transitions. Word has length 105 [2019-10-22 08:55:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,810 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 627 transitions. [2019-10-22 08:55:24,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 627 transitions. [2019-10-22 08:55:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:55:24,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,811 INFO L380 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:24,811 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1882644280, now seen corresponding path program 1 times [2019-10-22 08:55:24,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204118912] [2019-10-22 08:55:24,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-22 08:55:24,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204118912] [2019-10-22 08:55:24,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:24,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:24,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208635300] [2019-10-22 08:55:24,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:24,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:24,839 INFO L87 Difference]: Start difference. First operand 391 states and 627 transitions. Second operand 3 states. [2019-10-22 08:55:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:24,962 INFO L93 Difference]: Finished difference Result 777 states and 1245 transitions. [2019-10-22 08:55:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:24,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 08:55:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:24,964 INFO L225 Difference]: With dead ends: 777 [2019-10-22 08:55:24,964 INFO L226 Difference]: Without dead ends: 393 [2019-10-22 08:55:24,965 INFO L600 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-10-22 08:55:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-22 08:55:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-10-22 08:55:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-22 08:55:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 624 transitions. [2019-10-22 08:55:24,976 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 624 transitions. Word has length 106 [2019-10-22 08:55:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:24,977 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 624 transitions. [2019-10-22 08:55:24,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 624 transitions. [2019-10-22 08:55:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-22 08:55:24,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:24,978 INFO L380 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, 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-10-22 08:55:24,978 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:24,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1260059449, now seen corresponding path program 1 times [2019-10-22 08:55:24,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:24,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298791163] [2019-10-22 08:55:24,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:24,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:25,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298791163] [2019-10-22 08:55:25,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:25,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827950647] [2019-10-22 08:55:25,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:25,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:25,007 INFO L87 Difference]: Start difference. First operand 391 states and 624 transitions. Second operand 3 states. [2019-10-22 08:55:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,138 INFO L93 Difference]: Finished difference Result 822 states and 1311 transitions. [2019-10-22 08:55:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:25,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-22 08:55:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,140 INFO L225 Difference]: With dead ends: 822 [2019-10-22 08:55:25,140 INFO L226 Difference]: Without dead ends: 438 [2019-10-22 08:55:25,141 INFO L600 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-10-22 08:55:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-22 08:55:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2019-10-22 08:55:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-22 08:55:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2019-10-22 08:55:25,156 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 111 [2019-10-22 08:55:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,157 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2019-10-22 08:55:25,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2019-10-22 08:55:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-22 08:55:25,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,159 INFO L380 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, 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] [2019-10-22 08:55:25,159 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1753706176, now seen corresponding path program 1 times [2019-10-22 08:55:25,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145175793] [2019-10-22 08:55:25,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 08:55:25,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145175793] [2019-10-22 08:55:25,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:25,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298312319] [2019-10-22 08:55:25,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:25,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:25,223 INFO L87 Difference]: Start difference. First operand 433 states and 689 transitions. Second operand 3 states. [2019-10-22 08:55:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,367 INFO L93 Difference]: Finished difference Result 868 states and 1382 transitions. [2019-10-22 08:55:25,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:25,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-22 08:55:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,369 INFO L225 Difference]: With dead ends: 868 [2019-10-22 08:55:25,369 INFO L226 Difference]: Without dead ends: 440 [2019-10-22 08:55:25,370 INFO L600 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-10-22 08:55:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-22 08:55:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-10-22 08:55:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-22 08:55:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 692 transitions. [2019-10-22 08:55:25,382 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 692 transitions. Word has length 112 [2019-10-22 08:55:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,382 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 692 transitions. [2019-10-22 08:55:25,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 692 transitions. [2019-10-22 08:55:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 08:55:25,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,384 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:25,386 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash 793971013, now seen corresponding path program 1 times [2019-10-22 08:55:25,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852532939] [2019-10-22 08:55:25,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-22 08:55:25,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852532939] [2019-10-22 08:55:25,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:25,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439999460] [2019-10-22 08:55:25,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:25,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:25,417 INFO L87 Difference]: Start difference. First operand 435 states and 692 transitions. Second operand 3 states. [2019-10-22 08:55:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,529 INFO L93 Difference]: Finished difference Result 901 states and 1437 transitions. [2019-10-22 08:55:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:25,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-22 08:55:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,531 INFO L225 Difference]: With dead ends: 901 [2019-10-22 08:55:25,531 INFO L226 Difference]: Without dead ends: 473 [2019-10-22 08:55:25,532 INFO L600 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-10-22 08:55:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-22 08:55:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-10-22 08:55:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-22 08:55:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 727 transitions. [2019-10-22 08:55:25,546 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 727 transitions. Word has length 123 [2019-10-22 08:55:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,546 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 727 transitions. [2019-10-22 08:55:25,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 727 transitions. [2019-10-22 08:55:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-22 08:55:25,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,548 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:25,548 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2143195791, now seen corresponding path program 1 times [2019-10-22 08:55:25,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118770975] [2019-10-22 08:55:25,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-22 08:55:25,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118770975] [2019-10-22 08:55:25,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:25,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366863138] [2019-10-22 08:55:25,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:25,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:25,582 INFO L87 Difference]: Start difference. First operand 460 states and 727 transitions. Second operand 3 states. [2019-10-22 08:55:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,700 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2019-10-22 08:55:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:25,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-22 08:55:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,702 INFO L225 Difference]: With dead ends: 926 [2019-10-22 08:55:25,703 INFO L226 Difference]: Without dead ends: 473 [2019-10-22 08:55:25,703 INFO L600 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-10-22 08:55:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-22 08:55:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-10-22 08:55:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-22 08:55:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 719 transitions. [2019-10-22 08:55:25,716 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 719 transitions. Word has length 124 [2019-10-22 08:55:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,717 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 719 transitions. [2019-10-22 08:55:25,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 719 transitions. [2019-10-22 08:55:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-22 08:55:25,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,718 INFO L380 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, 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] [2019-10-22 08:55:25,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash -418940064, now seen corresponding path program 1 times [2019-10-22 08:55:25,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905284410] [2019-10-22 08:55:25,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-22 08:55:25,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905284410] [2019-10-22 08:55:25,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:25,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939732292] [2019-10-22 08:55:25,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:25,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:25,753 INFO L87 Difference]: Start difference. First operand 460 states and 719 transitions. Second operand 3 states. [2019-10-22 08:55:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:25,882 INFO L93 Difference]: Finished difference Result 917 states and 1432 transitions. [2019-10-22 08:55:25,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:25,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-22 08:55:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:25,884 INFO L225 Difference]: With dead ends: 917 [2019-10-22 08:55:25,884 INFO L226 Difference]: Without dead ends: 464 [2019-10-22 08:55:25,884 INFO L600 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-10-22 08:55:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-22 08:55:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-10-22 08:55:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-22 08:55:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2019-10-22 08:55:25,898 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 136 [2019-10-22 08:55:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:25,898 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2019-10-22 08:55:25,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2019-10-22 08:55:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-22 08:55:25,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:25,900 INFO L380 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, 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] [2019-10-22 08:55:25,900 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash 307186329, now seen corresponding path program 1 times [2019-10-22 08:55:25,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:25,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753509770] [2019-10-22 08:55:25,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:25,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-22 08:55:25,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753509770] [2019-10-22 08:55:25,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:25,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:25,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678515602] [2019-10-22 08:55:25,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:25,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:25,937 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand 3 states. [2019-10-22 08:55:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:26,060 INFO L93 Difference]: Finished difference Result 917 states and 1422 transitions. [2019-10-22 08:55:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:26,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-22 08:55:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:26,062 INFO L225 Difference]: With dead ends: 917 [2019-10-22 08:55:26,062 INFO L226 Difference]: Without dead ends: 464 [2019-10-22 08:55:26,063 INFO L600 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-10-22 08:55:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-22 08:55:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-10-22 08:55:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-22 08:55:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 709 transitions. [2019-10-22 08:55:26,077 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 709 transitions. Word has length 137 [2019-10-22 08:55:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:26,077 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 709 transitions. [2019-10-22 08:55:26,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 709 transitions. [2019-10-22 08:55:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-22 08:55:26,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:26,079 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:26,079 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash 791534820, now seen corresponding path program 1 times [2019-10-22 08:55:26,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:26,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527206553] [2019-10-22 08:55:26,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-22 08:55:26,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527206553] [2019-10-22 08:55:26,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:26,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:26,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429885720] [2019-10-22 08:55:26,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:26,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:26,133 INFO L87 Difference]: Start difference. First operand 460 states and 709 transitions. Second operand 3 states. [2019-10-22 08:55:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:26,258 INFO L93 Difference]: Finished difference Result 941 states and 1452 transitions. [2019-10-22 08:55:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:26,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-22 08:55:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:26,261 INFO L225 Difference]: With dead ends: 941 [2019-10-22 08:55:26,261 INFO L226 Difference]: Without dead ends: 488 [2019-10-22 08:55:26,262 INFO L600 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-10-22 08:55:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-10-22 08:55:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-10-22 08:55:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-22 08:55:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 740 transitions. [2019-10-22 08:55:26,278 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 740 transitions. Word has length 144 [2019-10-22 08:55:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:26,278 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 740 transitions. [2019-10-22 08:55:26,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 740 transitions. [2019-10-22 08:55:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-22 08:55:26,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:26,280 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:26,280 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -335636264, now seen corresponding path program 1 times [2019-10-22 08:55:26,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:26,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242324663] [2019-10-22 08:55:26,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-22 08:55:26,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242324663] [2019-10-22 08:55:26,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:26,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:26,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815388889] [2019-10-22 08:55:26,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:26,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:26,320 INFO L87 Difference]: Start difference. First operand 484 states and 740 transitions. Second operand 3 states. [2019-10-22 08:55:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:26,440 INFO L93 Difference]: Finished difference Result 965 states and 1474 transitions. [2019-10-22 08:55:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:26,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-22 08:55:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:26,443 INFO L225 Difference]: With dead ends: 965 [2019-10-22 08:55:26,443 INFO L226 Difference]: Without dead ends: 488 [2019-10-22 08:55:26,444 INFO L600 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-10-22 08:55:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-10-22 08:55:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-10-22 08:55:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-22 08:55:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 731 transitions. [2019-10-22 08:55:26,458 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 731 transitions. Word has length 145 [2019-10-22 08:55:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:26,458 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 731 transitions. [2019-10-22 08:55:26,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 731 transitions. [2019-10-22 08:55:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-22 08:55:26,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:26,461 INFO L380 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, 3, 3, 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] [2019-10-22 08:55:26,461 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -122343295, now seen corresponding path program 1 times [2019-10-22 08:55:26,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:26,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252919708] [2019-10-22 08:55:26,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-22 08:55:26,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252919708] [2019-10-22 08:55:26,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:26,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:26,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342795591] [2019-10-22 08:55:26,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:26,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:26,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:26,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:26,502 INFO L87 Difference]: Start difference. First operand 484 states and 731 transitions. Second operand 3 states. [2019-10-22 08:55:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:26,636 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2019-10-22 08:55:26,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:26,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-22 08:55:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:26,638 INFO L225 Difference]: With dead ends: 1008 [2019-10-22 08:55:26,638 INFO L226 Difference]: Without dead ends: 531 [2019-10-22 08:55:26,639 INFO L600 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-10-22 08:55:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-22 08:55:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2019-10-22 08:55:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-22 08:55:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 786 transitions. [2019-10-22 08:55:26,655 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 786 transitions. Word has length 151 [2019-10-22 08:55:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:26,655 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 786 transitions. [2019-10-22 08:55:26,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 786 transitions. [2019-10-22 08:55:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-22 08:55:26,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:26,657 INFO L380 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, 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] [2019-10-22 08:55:26,657 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1907415640, now seen corresponding path program 1 times [2019-10-22 08:55:26,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:26,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024003787] [2019-10-22 08:55:26,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-22 08:55:26,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024003787] [2019-10-22 08:55:26,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:26,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:26,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954704473] [2019-10-22 08:55:26,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:26,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:26,719 INFO L87 Difference]: Start difference. First operand 525 states and 786 transitions. Second operand 3 states. [2019-10-22 08:55:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:26,873 INFO L93 Difference]: Finished difference Result 1049 states and 1570 transitions. [2019-10-22 08:55:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:26,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-22 08:55:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:26,875 INFO L225 Difference]: With dead ends: 1049 [2019-10-22 08:55:26,875 INFO L226 Difference]: Without dead ends: 512 [2019-10-22 08:55:26,876 INFO L600 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-10-22 08:55:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-22 08:55:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2019-10-22 08:55:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-22 08:55:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2019-10-22 08:55:26,893 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 152 [2019-10-22 08:55:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:26,893 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2019-10-22 08:55:26,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2019-10-22 08:55:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-22 08:55:26,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:26,895 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:26,895 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1249588557, now seen corresponding path program 1 times [2019-10-22 08:55:26,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:26,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025126669] [2019-10-22 08:55:26,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:26,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-22 08:55:26,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025126669] [2019-10-22 08:55:26,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:26,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:26,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26841150] [2019-10-22 08:55:26,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:26,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:26,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:26,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:26,949 INFO L87 Difference]: Start difference. First operand 506 states and 756 transitions. Second operand 3 states. [2019-10-22 08:55:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:27,078 INFO L93 Difference]: Finished difference Result 1030 states and 1542 transitions. [2019-10-22 08:55:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:27,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-22 08:55:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:27,081 INFO L225 Difference]: With dead ends: 1030 [2019-10-22 08:55:27,081 INFO L226 Difference]: Without dead ends: 531 [2019-10-22 08:55:27,082 INFO L600 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-10-22 08:55:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-22 08:55:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2019-10-22 08:55:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-22 08:55:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 780 transitions. [2019-10-22 08:55:27,102 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 780 transitions. Word has length 165 [2019-10-22 08:55:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:27,102 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 780 transitions. [2019-10-22 08:55:27,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 780 transitions. [2019-10-22 08:55:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-22 08:55:27,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:27,106 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:27,106 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:27,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1409544545, now seen corresponding path program 1 times [2019-10-22 08:55:27,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:27,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561303642] [2019-10-22 08:55:27,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-22 08:55:27,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561303642] [2019-10-22 08:55:27,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:27,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:27,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954626676] [2019-10-22 08:55:27,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:27,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:27,184 INFO L87 Difference]: Start difference. First operand 527 states and 780 transitions. Second operand 3 states. [2019-10-22 08:55:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:27,304 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2019-10-22 08:55:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:27,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-22 08:55:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:27,306 INFO L225 Difference]: With dead ends: 1051 [2019-10-22 08:55:27,306 INFO L226 Difference]: Without dead ends: 529 [2019-10-22 08:55:27,307 INFO L600 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-10-22 08:55:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-10-22 08:55:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2019-10-22 08:55:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-22 08:55:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2019-10-22 08:55:27,325 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 166 [2019-10-22 08:55:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:27,326 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2019-10-22 08:55:27,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2019-10-22 08:55:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-22 08:55:27,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:27,328 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:27,328 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1453747987, now seen corresponding path program 1 times [2019-10-22 08:55:27,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:27,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534660258] [2019-10-22 08:55:27,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 08:55:27,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534660258] [2019-10-22 08:55:27,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592751153] [2019-10-22 08:55:27,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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-10-22 08:55:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:27,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:27,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-22 08:55:27,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:27,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:55:27,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987475] [2019-10-22 08:55:27,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:27,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:27,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:27,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:27,545 INFO L87 Difference]: Start difference. First operand 525 states and 766 transitions. Second operand 3 states. [2019-10-22 08:55:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:27,622 INFO L93 Difference]: Finished difference Result 1559 states and 2275 transitions. [2019-10-22 08:55:27,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:27,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-22 08:55:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:27,626 INFO L225 Difference]: With dead ends: 1559 [2019-10-22 08:55:27,626 INFO L226 Difference]: Without dead ends: 1041 [2019-10-22 08:55:27,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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-10-22 08:55:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-22 08:55:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2019-10-22 08:55:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-10-22 08:55:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1512 transitions. [2019-10-22 08:55:27,661 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1512 transitions. Word has length 181 [2019-10-22 08:55:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:27,661 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 1512 transitions. [2019-10-22 08:55:27,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1512 transitions. [2019-10-22 08:55:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 08:55:27,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:27,664 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-10-22 08:55:27,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:27,866 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676108, now seen corresponding path program 1 times [2019-10-22 08:55:27,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:27,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146860097] [2019-10-22 08:55:27,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-22 08:55:27,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146860097] [2019-10-22 08:55:27,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:27,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:27,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661346149] [2019-10-22 08:55:27,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:27,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:27,921 INFO L87 Difference]: Start difference. First operand 1041 states and 1512 transitions. Second operand 3 states. [2019-10-22 08:55:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:27,990 INFO L93 Difference]: Finished difference Result 2585 states and 3758 transitions. [2019-10-22 08:55:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:27,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-22 08:55:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:27,995 INFO L225 Difference]: With dead ends: 2585 [2019-10-22 08:55:27,995 INFO L226 Difference]: Without dead ends: 1551 [2019-10-22 08:55:27,997 INFO L600 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-10-22 08:55:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2019-10-22 08:55:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2019-10-22 08:55:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-10-22 08:55:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2248 transitions. [2019-10-22 08:55:28,042 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2248 transitions. Word has length 188 [2019-10-22 08:55:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:28,043 INFO L462 AbstractCegarLoop]: Abstraction has 1551 states and 2248 transitions. [2019-10-22 08:55:28,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2248 transitions. [2019-10-22 08:55:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-22 08:55:28,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:28,046 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-10-22 08:55:28,046 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash -373781024, now seen corresponding path program 1 times [2019-10-22 08:55:28,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:28,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255383215] [2019-10-22 08:55:28,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:28,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:28,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 08:55:28,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255383215] [2019-10-22 08:55:28,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:28,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:28,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492415375] [2019-10-22 08:55:28,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:28,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:28,091 INFO L87 Difference]: Start difference. First operand 1551 states and 2248 transitions. Second operand 3 states. [2019-10-22 08:55:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:28,209 INFO L93 Difference]: Finished difference Result 3606 states and 5231 transitions. [2019-10-22 08:55:28,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:28,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-22 08:55:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:28,215 INFO L225 Difference]: With dead ends: 3606 [2019-10-22 08:55:28,215 INFO L226 Difference]: Without dead ends: 2062 [2019-10-22 08:55:28,217 INFO L600 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-10-22 08:55:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-10-22 08:55:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2019-10-22 08:55:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-10-22 08:55:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2985 transitions. [2019-10-22 08:55:28,277 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2985 transitions. Word has length 189 [2019-10-22 08:55:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:28,277 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 2985 transitions. [2019-10-22 08:55:28,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2985 transitions. [2019-10-22 08:55:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-22 08:55:28,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:28,283 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:28,283 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1948421128, now seen corresponding path program 1 times [2019-10-22 08:55:28,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:28,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006330264] [2019-10-22 08:55:28,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:28,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:28,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-22 08:55:28,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006330264] [2019-10-22 08:55:28,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:28,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:28,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979089802] [2019-10-22 08:55:28,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:28,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:28,411 INFO L87 Difference]: Start difference. First operand 2062 states and 2985 transitions. Second operand 3 states. [2019-10-22 08:55:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:28,506 INFO L93 Difference]: Finished difference Result 5692 states and 8229 transitions. [2019-10-22 08:55:28,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:28,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-10-22 08:55:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:28,516 INFO L225 Difference]: With dead ends: 5692 [2019-10-22 08:55:28,516 INFO L226 Difference]: Without dead ends: 3637 [2019-10-22 08:55:28,519 INFO L600 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-10-22 08:55:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-10-22 08:55:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2019-10-22 08:55:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-10-22 08:55:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5245 transitions. [2019-10-22 08:55:28,637 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5245 transitions. Word has length 338 [2019-10-22 08:55:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:28,637 INFO L462 AbstractCegarLoop]: Abstraction has 3635 states and 5245 transitions. [2019-10-22 08:55:28,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5245 transitions. [2019-10-22 08:55:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-22 08:55:28,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:28,646 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:28,647 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1969862083, now seen corresponding path program 1 times [2019-10-22 08:55:28,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:28,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140608101] [2019-10-22 08:55:28,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:28,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:28,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-22 08:55:28,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140608101] [2019-10-22 08:55:28,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:28,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:28,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637577628] [2019-10-22 08:55:28,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:28,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:28,808 INFO L87 Difference]: Start difference. First operand 3635 states and 5245 transitions. Second operand 3 states. [2019-10-22 08:55:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:29,041 INFO L93 Difference]: Finished difference Result 7423 states and 10735 transitions. [2019-10-22 08:55:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:29,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-10-22 08:55:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:29,048 INFO L225 Difference]: With dead ends: 7423 [2019-10-22 08:55:29,049 INFO L226 Difference]: Without dead ends: 2498 [2019-10-22 08:55:29,052 INFO L600 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-10-22 08:55:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-10-22 08:55:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498. [2019-10-22 08:55:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-10-22 08:55:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3552 transitions. [2019-10-22 08:55:29,130 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3552 transitions. Word has length 375 [2019-10-22 08:55:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:29,131 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3552 transitions. [2019-10-22 08:55:29,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3552 transitions. [2019-10-22 08:55:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-22 08:55:29,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:29,140 INFO L380 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, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:29,141 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 943000906, now seen corresponding path program 1 times [2019-10-22 08:55:29,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:29,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413581890] [2019-10-22 08:55:29,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:29,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:29,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-22 08:55:29,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413581890] [2019-10-22 08:55:29,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958521881] [2019-10-22 08:55:29,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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-10-22 08:55:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:29,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:29,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-22 08:55:29,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:29,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:55:29,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394783878] [2019-10-22 08:55:29,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:29,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:29,618 INFO L87 Difference]: Start difference. First operand 2498 states and 3552 transitions. Second operand 3 states. [2019-10-22 08:55:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:29,672 INFO L93 Difference]: Finished difference Result 2558 states and 3638 transitions. [2019-10-22 08:55:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:29,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-10-22 08:55:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:29,679 INFO L225 Difference]: With dead ends: 2558 [2019-10-22 08:55:29,679 INFO L226 Difference]: Without dead ends: 2069 [2019-10-22 08:55:29,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 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-10-22 08:55:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-10-22 08:55:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2011. [2019-10-22 08:55:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-10-22 08:55:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2860 transitions. [2019-10-22 08:55:29,742 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2860 transitions. Word has length 441 [2019-10-22 08:55:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:29,742 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 2860 transitions. [2019-10-22 08:55:29,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2860 transitions. [2019-10-22 08:55:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-22 08:55:29,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:29,751 INFO L380 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, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:29,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:29,953 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1896941064, now seen corresponding path program 1 times [2019-10-22 08:55:29,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:29,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267880548] [2019-10-22 08:55:29,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:29,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:29,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-22 08:55:30,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267880548] [2019-10-22 08:55:30,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554049107] [2019-10-22 08:55:30,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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-10-22 08:55:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:30,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:30,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-10-22 08:55:30,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:30,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:55:30,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641878405] [2019-10-22 08:55:30,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:30,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:30,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:30,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:30,400 INFO L87 Difference]: Start difference. First operand 2011 states and 2860 transitions. Second operand 3 states. [2019-10-22 08:55:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:30,488 INFO L93 Difference]: Finished difference Result 4484 states and 6387 transitions. [2019-10-22 08:55:30,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:30,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-10-22 08:55:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:30,496 INFO L225 Difference]: With dead ends: 4484 [2019-10-22 08:55:30,501 INFO L226 Difference]: Without dead ends: 2480 [2019-10-22 08:55:30,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 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-10-22 08:55:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-10-22 08:55:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2480. [2019-10-22 08:55:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2480 states. [2019-10-22 08:55:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3528 transitions. [2019-10-22 08:55:30,578 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3528 transitions. Word has length 441 [2019-10-22 08:55:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:30,578 INFO L462 AbstractCegarLoop]: Abstraction has 2480 states and 3528 transitions. [2019-10-22 08:55:30,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3528 transitions. [2019-10-22 08:55:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-10-22 08:55:30,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:30,587 INFO L380 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, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:30,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:30,788 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash -699120285, now seen corresponding path program 1 times [2019-10-22 08:55:30,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:30,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442784979] [2019-10-22 08:55:30,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:30,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:30,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-22 08:55:30,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442784979] [2019-10-22 08:55:30,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219938577] [2019-10-22 08:55:30,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/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-10-22 08:55:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-10-22 08:55:31,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:31,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:55:31,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103610423] [2019-10-22 08:55:31,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:31,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:31,122 INFO L87 Difference]: Start difference. First operand 2480 states and 3528 transitions. Second operand 3 states. [2019-10-22 08:55:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:31,250 INFO L93 Difference]: Finished difference Result 5462 states and 7775 transitions. [2019-10-22 08:55:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:31,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-10-22 08:55:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:31,265 INFO L225 Difference]: With dead ends: 5462 [2019-10-22 08:55:31,269 INFO L226 Difference]: Without dead ends: 2989 [2019-10-22 08:55:31,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 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-10-22 08:55:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-10-22 08:55:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2989. [2019-10-22 08:55:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-10-22 08:55:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4248 transitions. [2019-10-22 08:55:31,353 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4248 transitions. Word has length 442 [2019-10-22 08:55:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:31,354 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 4248 transitions. [2019-10-22 08:55:31,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4248 transitions. [2019-10-22 08:55:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-10-22 08:55:31,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:31,363 INFO L380 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, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:31,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:31,564 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:31,565 INFO L82 PathProgramCache]: Analyzing trace with hash -517858284, now seen corresponding path program 1 times [2019-10-22 08:55:31,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:31,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569072858] [2019-10-22 08:55:31,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:31,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:31,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-22 08:55:31,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569072858] [2019-10-22 08:55:31,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090576159] [2019-10-22 08:55:31,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-22 08:55:31,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:55:31,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 08:55:31,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170384825] [2019-10-22 08:55:31,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:31,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:31,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:31,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:31,910 INFO L87 Difference]: Start difference. First operand 2989 states and 4248 transitions. Second operand 3 states. [2019-10-22 08:55:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:32,010 INFO L93 Difference]: Finished difference Result 6439 states and 9162 transitions. [2019-10-22 08:55:32,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:32,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-10-22 08:55:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:32,025 INFO L225 Difference]: With dead ends: 6439 [2019-10-22 08:55:32,026 INFO L226 Difference]: Without dead ends: 3457 [2019-10-22 08:55:32,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 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-10-22 08:55:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-10-22 08:55:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3457. [2019-10-22 08:55:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2019-10-22 08:55:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4915 transitions. [2019-10-22 08:55:32,131 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4915 transitions. Word has length 443 [2019-10-22 08:55:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:32,131 INFO L462 AbstractCegarLoop]: Abstraction has 3457 states and 4915 transitions. [2019-10-22 08:55:32,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4915 transitions. [2019-10-22 08:55:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-10-22 08:55:32,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:32,146 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:32,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:32,347 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1394872725, now seen corresponding path program 1 times [2019-10-22 08:55:32,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:32,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358530476] [2019-10-22 08:55:32,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:32,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:32,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-22 08:55:32,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358530476] [2019-10-22 08:55:32,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619500490] [2019-10-22 08:55:32,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:32,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:32,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-22 08:55:32,928 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:32,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:55:32,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672288573] [2019-10-22 08:55:32,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:32,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:32,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:32,930 INFO L87 Difference]: Start difference. First operand 3457 states and 4915 transitions. Second operand 4 states. [2019-10-22 08:55:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:33,176 INFO L93 Difference]: Finished difference Result 6879 states and 9779 transitions. [2019-10-22 08:55:33,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:33,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 594 [2019-10-22 08:55:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:33,183 INFO L225 Difference]: With dead ends: 6879 [2019-10-22 08:55:33,188 INFO L226 Difference]: Without dead ends: 3352 [2019-10-22 08:55:33,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 596 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-10-22 08:55:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-10-22 08:55:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3092. [2019-10-22 08:55:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-10-22 08:55:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-10-22 08:55:33,281 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 594 [2019-10-22 08:55:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:33,281 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-10-22 08:55:33,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-10-22 08:55:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-10-22 08:55:33,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:33,292 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:33,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:33,493 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:33,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1182493111, now seen corresponding path program 1 times [2019-10-22 08:55:33,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:33,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914363954] [2019-10-22 08:55:33,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:33,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:33,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-22 08:55:34,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914363954] [2019-10-22 08:55:34,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494976981] [2019-10-22 08:55:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:34,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:34,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-22 08:55:34,585 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:34,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:55:34,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364218633] [2019-10-22 08:55:34,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:34,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:34,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:34,588 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 4 states. [2019-10-22 08:55:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:34,859 INFO L93 Difference]: Finished difference Result 7201 states and 9931 transitions. [2019-10-22 08:55:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:34,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1014 [2019-10-22 08:55:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:34,867 INFO L225 Difference]: With dead ends: 7201 [2019-10-22 08:55:34,867 INFO L226 Difference]: Without dead ends: 3932 [2019-10-22 08:55:34,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1016 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-10-22 08:55:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-10-22 08:55:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3092. [2019-10-22 08:55:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-10-22 08:55:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-10-22 08:55:34,956 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 1014 [2019-10-22 08:55:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:34,956 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-10-22 08:55:34,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-10-22 08:55:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2019-10-22 08:55:34,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:34,969 INFO L380 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:35,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:35,170 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash 283829187, now seen corresponding path program 1 times [2019-10-22 08:55:35,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:35,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518189637] [2019-10-22 08:55:35,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:35,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-10-22 08:55:35,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518189637] [2019-10-22 08:55:35,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:35,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:35,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334217802] [2019-10-22 08:55:35,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:35,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:35,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:35,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:35,909 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 3 states. [2019-10-22 08:55:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:36,078 INFO L93 Difference]: Finished difference Result 6327 states and 8667 transitions. [2019-10-22 08:55:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:36,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1264 [2019-10-22 08:55:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:36,084 INFO L225 Difference]: With dead ends: 6327 [2019-10-22 08:55:36,085 INFO L226 Difference]: Without dead ends: 3218 [2019-10-22 08:55:36,088 INFO L600 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-10-22 08:55:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-10-22 08:55:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3148. [2019-10-22 08:55:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-10-22 08:55:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4298 transitions. [2019-10-22 08:55:36,164 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4298 transitions. Word has length 1264 [2019-10-22 08:55:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:36,165 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 4298 transitions. [2019-10-22 08:55:36,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4298 transitions. [2019-10-22 08:55:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-10-22 08:55:36,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:36,178 INFO L380 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:36,178 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 515038815, now seen corresponding path program 1 times [2019-10-22 08:55:36,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:36,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986807695] [2019-10-22 08:55:36,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:36,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-10-22 08:55:36,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986807695] [2019-10-22 08:55:36,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:36,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:36,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097928823] [2019-10-22 08:55:36,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:36,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:36,999 INFO L87 Difference]: Start difference. First operand 3148 states and 4298 transitions. Second operand 3 states. [2019-10-22 08:55:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:37,120 INFO L93 Difference]: Finished difference Result 4148 states and 5651 transitions. [2019-10-22 08:55:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:37,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1294 [2019-10-22 08:55:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:37,122 INFO L225 Difference]: With dead ends: 4148 [2019-10-22 08:55:37,122 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:55:37,124 INFO L600 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-10-22 08:55:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:55:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:55:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:55:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:37,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1294 [2019-10-22 08:55:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:37,125 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:37,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:37,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:55:37,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:55:37,532 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-10-22 08:55:38,228 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-10-22 08:55:39,125 WARN L191 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-10-22 08:55:39,684 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2019-10-22 08:55:40,232 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-10-22 08:55:40,831 WARN L191 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-10-22 08:55:41,225 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-10-22 08:55:41,428 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:55:41,911 WARN L191 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-10-22 08:55:42,263 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-10-22 08:55:42,476 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:55:42,864 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-10-22 08:55:43,212 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-10-22 08:55:43,321 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-22 08:55:43,731 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-10-22 08:55:44,354 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-10-22 08:55:44,720 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-10-22 08:55:45,265 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-10-22 08:55:45,821 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-10-22 08:55:46,171 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-10-22 08:55:46,522 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-10-22 08:55:46,877 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-10-22 08:55:47,113 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 537) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 569) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 580) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 591) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 602) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 502) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-10-22 08:55:47,115 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-10-22 08:55:47,116 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 570) the Hoare annotation is: (let ((.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse28 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 8513))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.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 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) [2019-10-22 08:55:47,116 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 602) 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 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-10-22 08:55:47,116 INFO L446 ceAbstractionStarter]: At program point L632(lines 11 634) the Hoare annotation is: true [2019-10-22 08:55:47,117 INFO L439 ceAbstractionStarter]: At program point L566(lines 99 621) the Hoare annotation is: (let ((.cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse19 (not .cse20)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse10) (and .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse1 (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)) .cse12 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse4 .cse13 .cse5 .cse6 .cse14 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse17 .cse18 .cse7 .cse8 .cse9 .cse10 .cse19) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse21) (and .cse22 .cse19) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse19) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)))))) [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 536) no Hoare annotation was computed. [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L534-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 568) no Hoare annotation was computed. [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 579) no Hoare annotation was computed. [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 590) no Hoare annotation was computed. [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 601) no Hoare annotation was computed. [2019-10-22 08:55:47,117 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-10-22 08:55:47,118 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-10-22 08:55:47,118 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 568) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-10-22 08:55:47,119 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 580) the Hoare annotation is: (let ((.cse11 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (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))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.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))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse29 (not .cse11))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse0 .cse2 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse26 .cse27 .cse10 .cse28 .cse13 .cse14 .cse16 .cse29) (and .cse18 .cse19 .cse20 .cse0 .cse2 .cse3 .cse4 .cse21 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse26 .cse27 .cse10 .cse28 .cse13 .cse14 .cse16 .cse29)))) [2019-10-22 08:55:47,119 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 591) the Hoare annotation is: (let ((.cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse23 .cse27 .cse24) (and .cse26 (and (and .cse28 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse21 .cse23 .cse24) .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 619) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 514) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 568) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 578) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 589) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 600) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 618) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-10-22 08:55:47,119 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 610) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L605-2(lines 604 618) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 513) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 577) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 588) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 599) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 485) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-10-22 08:55:47,120 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-10-22 08:55:47,121 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 601) the Hoare annotation is: (let ((.cse27 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.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 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse20 .cse22 .cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse24) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24))) [2019-10-22 08:55:47,121 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 578) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.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 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse27 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28)))) [2019-10-22 08:55:47,121 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 589) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (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))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not .cse28)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (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 8544))) (.cse9 (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))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse26 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19 .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse19 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23)))) [2019-10-22 08:55:47,121 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-10-22 08:55:47,121 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-10-22 08:55:47,121 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 547) no Hoare annotation was computed. [2019-10-22 08:55:47,121 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2019-10-22 08:55:47,121 INFO L443 ceAbstractionStarter]: For program point L543-2(lines 543 547) no Hoare annotation was computed. [2019-10-22 08:55:47,121 INFO L443 ceAbstractionStarter]: For program point L510-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 576) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 587) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 598) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L446 ceAbstractionStarter]: At program point L644(lines 635 646) the Hoare annotation is: true [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 616) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 575) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 586) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 597) no Hoare annotation was computed. [2019-10-22 08:55:47,123 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 483) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 576) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.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))) (.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 12292))) (.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 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2019-10-22 08:55:47,124 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 587) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (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 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28) (and .cse1 (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)) (and .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28)))) [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L439 ceAbstractionStarter]: At program point L482(lines 72 633) the Hoare annotation is: false [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L439 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (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 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28) (and .cse1 (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)) (and .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse20 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4 .cse5 .cse21 .cse6 .cse7 .cse22 .cse8 .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse11 .cse12 .cse14 .cse28)))) [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 574) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 585) no Hoare annotation was computed. [2019-10-22 08:55:47,124 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 596) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L439 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 8608))) (.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 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse22 .cse27 .cse23)) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-10-22 08:55:47,125 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 597) the Hoare annotation is: (let ((.cse29 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.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))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse28 (not .cse29))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse13 .cse14 .cse28) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse17 .cse18 .cse19 .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse10 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse13 .cse14 .cse28)))) [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L321-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 573) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 584) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 595) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 633) no Hoare annotation was computed. [2019-10-22 08:55:47,125 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 559) no Hoare annotation was computed. [2019-10-22 08:55:47,126 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 523) no Hoare annotation was computed. [2019-10-22 08:55:47,126 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 553 559) no Hoare annotation was computed. [2019-10-22 08:55:47,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2019-10-22 08:55:47,126 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-10-22 08:55:47,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:55:47,126 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 574) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28)))) [2019-10-22 08:55:47,127 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 585) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 8608))) (.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 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse22 .cse27 .cse23)) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-10-22 08:55:47,127 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 595) 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-10-22 08:55:47,127 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-22 08:55:47,127 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-10-22 08:55:47,127 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-10-22 08:55:47,127 INFO L443 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2019-10-22 08:55:47,127 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 572) no Hoare annotation was computed. [2019-10-22 08:55:47,127 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 583) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 594) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L446 ceAbstractionStarter]: At program point L622(lines 98 623) the Hoare annotation is: true [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 565) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-10-22 08:55:47,128 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-10-22 08:55:47,129 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 571) no Hoare annotation was computed. [2019-10-22 08:55:47,129 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 582) no Hoare annotation was computed. [2019-10-22 08:55:47,129 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 593) no Hoare annotation was computed. [2019-10-22 08:55:47,129 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 572) the Hoare annotation is: (let ((.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse26 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse27 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.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 12292))) (.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 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24))) [2019-10-22 08:55:47,129 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 583) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 8608))) (.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 12292))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.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 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse19 .cse26 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and (and .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14 .cse19 .cse21 .cse22 .cse27 .cse23) .cse25) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 629) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L627-2(lines 627 629) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 538) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 570) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 581) no Hoare annotation was computed. [2019-10-22 08:55:47,130 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 592) no Hoare annotation was computed. [2019-10-22 08:55:47,131 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 621) the Hoare annotation is: (let ((.cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse19 (not .cse20)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse10) (and .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse1 (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)) .cse12 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse4 .cse13 .cse5 .cse6 .cse14 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse17 .cse18 .cse7 .cse8 .cse9 .cse10 .cse19) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse21) (and .cse22 .cse19) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse19) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)))))) [2019-10-22 08:55:47,131 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 8608))) (.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 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse21 .cse22 .cse27 .cse23)) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse21 .cse22 .cse27 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-10-22 08:55:47,131 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-10-22 08:55:47,131 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 581) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse26 (not .cse27)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.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))) (.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))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse28 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse22 .cse27 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse25) (and .cse0 .cse28 .cse29 .cse30) (and .cse28 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse29 .cse27 .cse30)))) [2019-10-22 08:55:47,131 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 594) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse30 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.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))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse29 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse14 .cse16 .cse29) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse30 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse14 .cse16 .cse29) (and .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse30 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse14 .cse16 .cse29))) [2019-10-22 08:55:47,131 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 08:55:47,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:47 BoogieIcfgContainer [2019-10-22 08:55:47,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:47,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:47,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:47,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:47,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:21" (3/4) ... [2019-10-22 08:55:47,195 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:55:47,209 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:55:47,209 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:55:47,303 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3fe750aa-ffdb-4e97-b4ec-e80024e4afc3/bin/uautomizer/witness.graphml [2019-10-22 08:55:47,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:47,304 INFO L168 Benchmark]: Toolchain (without parser) took 26703.35 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 949.9 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 749.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,304 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:47,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:47,305 INFO L168 Benchmark]: Boogie Preprocessor took 56.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,305 INFO L168 Benchmark]: RCFGBuilder took 611.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,305 INFO L168 Benchmark]: TraceAbstraction took 25436.11 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,305 INFO L168 Benchmark]: Witness Printer took 111.96 ms. Allocated memory is still 3.1 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:47,307 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 611.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25436.11 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 111.96 ms. Allocated memory is still 3.1 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 631]: 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: 126]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(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 == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(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)) && 4 == blastFlag) && !(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))) || (((((((((((((((((((((((((((!(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)) && 3 == blastFlag) && !(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 == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((((blastFlag <= 2 && !(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)) && !(0 == s__hit)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((((((((((((!(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)) && 4 == blastFlag) && !(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__state == 8513) && !(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 == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((((8448 <= s__state && 3 == blastFlag) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 123]: 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: 376]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(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 == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(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 == 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 == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(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 == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(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 == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576)) || (4 == blastFlag && !(0 == s__hit))) || s__state <= 3) || (blastFlag <= 2 && !(0 == s__hit))) || ((8448 <= s__state && s__state <= 8448) && 4 == blastFlag && s__s3__tmp__next_state___0 <= 3) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(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 == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(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 == 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 == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(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__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(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 == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(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)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(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))) || (((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(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)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(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 == 8529)) && !(s__state == 8544)) && !(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 == 8577) && !(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 == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(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 == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(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 == 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))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(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 == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(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))) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(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: 180]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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 == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(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 == 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 == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(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 == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(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 == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(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 == 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 == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(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)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(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))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((8448 <= s__state && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 102]: 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 == 8561)) && 4 == blastFlag) && !(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)) || ((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(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__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(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 == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && 0 == s__hit) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(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))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(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 == 8673)) && !(s__state == 8544)) && !(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: 105]: 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 == 8561)) && 4 == blastFlag) && !(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)) || (((((((((((((((((((((((((((!(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)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(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)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((((!(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)) && 3 == blastFlag) && !(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))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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))) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(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 == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((((blastFlag <= 2 && !(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__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(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))) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(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: 135]: 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)) && 3 == blastFlag) && !(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)) || (((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480))) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(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 == 8545)) && !(s__state == 8448)) && !(s__state == 8480)) && s__state <= 8576)) || (((((((((((((((((((((((((!(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)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(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))) || (((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((((((((((!(s__state == 8577) && !(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 == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(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 == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8641)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576)) || (4 == blastFlag && !(0 == s__hit))) || s__state <= 3) || (blastFlag <= 2 && !(0 == s__hit))) || ((8448 <= s__state && s__state <= 8448) && 4 == blastFlag && s__s3__tmp__next_state___0 <= 3) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(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)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((blastFlag <= 2 && !(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 == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(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 == 8608) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(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)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && 4 == blastFlag) && !(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)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(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: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(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 == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) || (((((((((((((((((((((((((!(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)) && 4 == blastFlag) && !(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 == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576)) || (((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(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 == 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)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(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 == 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)) && !(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)) && 3 == blastFlag) && !(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)) && !(s__state == 8512)) && 8448 <= s__state) && !(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)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(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 == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Result: SAFE, OverallTime: 25.3s, OverallIterations: 39, TraceHistogramMax: 46, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.9s, HoareTripleCheckerStatistics: 7425 SDtfs, 5594 SDslu, 2523 SDs, 0 SdLazy, 3264 SolverSat, 1331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3651 GetRequests, 3598 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 1350 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 271 NumberOfFragments, 7990 HoareAnnotationTreeSize, 28 FomulaSimplifications, 38976 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 10722 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 13581 NumberOfCodeBlocks, 13581 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 13535 ConstructedInterpolants, 0 QuantifiedInterpolants, 9879497 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5422 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 92901/93135 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...