./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.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_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/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 8dbf24b59541dccb09f8dbc14fce93010bd20ba8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:02:25,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:25,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:25,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:25,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:25,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:25,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:25,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:25,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:25,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:25,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:25,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:25,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:25,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:25,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:25,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:25,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:25,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:25,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:25,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:25,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:25,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:25,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:25,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:25,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:25,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:25,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:25,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:25,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:25,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:25,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:25,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:25,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:25,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:25,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:25,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:25,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:25,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:25,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:25,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:25,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:25,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:25,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:25,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:25,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:25,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:25,673 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:25,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:25,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:25,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:25,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:25,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:25,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:25,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:25,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:25,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:25,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:25,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:25,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:25,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:25,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:25,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:25,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:25,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:25,678 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_16da5375-cbaa-406c-8c58-cd0de89f9d43/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 -> 8dbf24b59541dccb09f8dbc14fce93010bd20ba8 [2019-10-22 09:02:25,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:25,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:25,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:25,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:25,727 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:25,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-10-22 09:02:25,784 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/data/790d829c7/88c012bd75c94c4d8c39f6f626abfd21/FLAGe7bf97226 [2019-10-22 09:02:26,218 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:26,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-10-22 09:02:26,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/data/790d829c7/88c012bd75c94c4d8c39f6f626abfd21/FLAGe7bf97226 [2019-10-22 09:02:26,239 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/data/790d829c7/88c012bd75c94c4d8c39f6f626abfd21 [2019-10-22 09:02:26,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:26,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:26,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:26,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:26,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:26,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7ee661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26, skipping insertion in model container [2019-10-22 09:02:26,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:26,311 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:26,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:26,635 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:26,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:26,720 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:26,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26 WrapperNode [2019-10-22 09:02:26,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:26,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:26,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:26,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:26,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:26,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:26,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:26,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:26,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... [2019-10-22 09:02:26,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:26,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:26,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:26,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:26,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/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 09:02:26,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:26,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:26,936 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:27,502 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 09:02:27,502 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 09:02:27,503 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:27,503 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:27,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:27 BoogieIcfgContainer [2019-10-22 09:02:27,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:27,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:27,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:27,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:27,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:26" (1/3) ... [2019-10-22 09:02:27,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454a64c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:27, skipping insertion in model container [2019-10-22 09:02:27,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:26" (2/3) ... [2019-10-22 09:02:27,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454a64c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:27, skipping insertion in model container [2019-10-22 09:02:27,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:27" (3/3) ... [2019-10-22 09:02:27,511 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-22 09:02:27,525 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:27,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:27,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:27,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:27,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:27,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:27,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:27,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:27,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:27,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:27,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-10-22 09:02:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 09:02:27,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:27,594 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, 1] [2019-10-22 09:02:27,595 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-10-22 09:02:27,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612678167] [2019-10-22 09:02:27,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,804 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 09:02:27,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612678167] [2019-10-22 09:02:27,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:27,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:27,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269080271] [2019-10-22 09:02:27,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:27,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:27,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:27,824 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-10-22 09:02:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:28,065 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-10-22 09:02:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:28,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 09:02:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:28,077 INFO L225 Difference]: With dead ends: 327 [2019-10-22 09:02:28,078 INFO L226 Difference]: Without dead ends: 174 [2019-10-22 09:02:28,081 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 09:02:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-22 09:02:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-10-22 09:02:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-22 09:02:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-10-22 09:02:28,134 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-10-22 09:02:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:28,134 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-10-22 09:02:28,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-10-22 09:02:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:02:28,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:28,136 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, 1, 1] [2019-10-22 09:02:28,137 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-10-22 09:02:28,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804853945] [2019-10-22 09:02:28,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,234 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 09:02:28,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804853945] [2019-10-22 09:02:28,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:28,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:28,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725461548] [2019-10-22 09:02:28,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:28,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:28,240 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-10-22 09:02:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:28,471 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-10-22 09:02:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:28,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 09:02:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:28,473 INFO L225 Difference]: With dead ends: 379 [2019-10-22 09:02:28,474 INFO L226 Difference]: Without dead ends: 215 [2019-10-22 09:02:28,475 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 09:02:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-22 09:02:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-10-22 09:02:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-22 09:02:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-10-22 09:02:28,501 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-10-22 09:02:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:28,501 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-10-22 09:02:28,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-10-22 09:02:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 09:02:28,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:28,507 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, 1, 1] [2019-10-22 09:02:28,508 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-10-22 09:02:28,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513810894] [2019-10-22 09:02:28,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,610 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 09:02:28,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513810894] [2019-10-22 09:02:28,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:28,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:28,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891656266] [2019-10-22 09:02:28,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:28,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:28,615 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-10-22 09:02:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:28,820 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-10-22 09:02:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:28,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 09:02:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:28,823 INFO L225 Difference]: With dead ends: 444 [2019-10-22 09:02:28,823 INFO L226 Difference]: Without dead ends: 241 [2019-10-22 09:02:28,824 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 09:02:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-22 09:02:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-10-22 09:02:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-22 09:02:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-10-22 09:02:28,850 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-10-22 09:02:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:28,851 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-10-22 09:02:28,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-10-22 09:02:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 09:02:28,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:28,860 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, 1, 1] [2019-10-22 09:02:28,860 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:28,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,861 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-10-22 09:02:28,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097115179] [2019-10-22 09:02:28,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:28,908 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 09:02:28,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097115179] [2019-10-22 09:02:28,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:28,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:28,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823754102] [2019-10-22 09:02:28,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:28,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:28,910 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-10-22 09:02:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,061 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-10-22 09:02:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:29,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 09:02:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:29,063 INFO L225 Difference]: With dead ends: 492 [2019-10-22 09:02:29,063 INFO L226 Difference]: Without dead ends: 258 [2019-10-22 09:02:29,064 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 09:02:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-22 09:02:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-22 09:02:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-22 09:02:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-10-22 09:02:29,076 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-10-22 09:02:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:29,076 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-10-22 09:02:29,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-10-22 09:02:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 09:02:29,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:29,078 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, 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 09:02:29,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-10-22 09:02:29,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10642129] [2019-10-22 09:02:29,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:29,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10642129] [2019-10-22 09:02:29,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:29,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337555040] [2019-10-22 09:02:29,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:29,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:29,151 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-10-22 09:02:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,381 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-10-22 09:02:29,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:29,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 09:02:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:29,383 INFO L225 Difference]: With dead ends: 551 [2019-10-22 09:02:29,383 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 09:02:29,384 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 09:02:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 09:02:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-10-22 09:02:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 09:02:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-10-22 09:02:29,408 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-10-22 09:02:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:29,409 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-10-22 09:02:29,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-10-22 09:02:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:02:29,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:29,411 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, 1, 1] [2019-10-22 09:02:29,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-10-22 09:02:29,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933884199] [2019-10-22 09:02:29,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,486 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 09:02:29,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933884199] [2019-10-22 09:02:29,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:29,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861007969] [2019-10-22 09:02:29,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:29,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:29,490 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-10-22 09:02:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,656 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-10-22 09:02:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:29,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:02:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:29,658 INFO L225 Difference]: With dead ends: 591 [2019-10-22 09:02:29,658 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 09:02:29,659 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 09:02:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 09:02:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-22 09:02:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 09:02:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-10-22 09:02:29,670 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-10-22 09:02:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:29,670 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-10-22 09:02:29,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-10-22 09:02:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:02:29,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:29,674 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, 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 09:02:29,675 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,675 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-10-22 09:02:29,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060535628] [2019-10-22 09:02:29,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:29,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060535628] [2019-10-22 09:02:29,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:29,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671869401] [2019-10-22 09:02:29,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:29,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:29,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:29,752 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-10-22 09:02:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:29,926 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-10-22 09:02:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:29,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:02:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:29,928 INFO L225 Difference]: With dead ends: 593 [2019-10-22 09:02:29,929 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 09:02:29,929 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 09:02:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 09:02:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-10-22 09:02:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-22 09:02:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-10-22 09:02:29,940 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-10-22 09:02:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:29,942 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-10-22 09:02:29,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-10-22 09:02:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-22 09:02:29,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:29,944 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, 1, 1] [2019-10-22 09:02:29,944 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-10-22 09:02:29,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:29,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402328884] [2019-10-22 09:02:29,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:29,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:29,998 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 09:02:29,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402328884] [2019-10-22 09:02:29,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:29,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:30,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216006701] [2019-10-22 09:02:30,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:30,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,001 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-10-22 09:02:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,095 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-10-22 09:02:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-22 09:02:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:30,097 INFO L225 Difference]: With dead ends: 594 [2019-10-22 09:02:30,097 INFO L226 Difference]: Without dead ends: 305 [2019-10-22 09:02:30,098 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 09:02:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-22 09:02:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-10-22 09:02:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-22 09:02:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-10-22 09:02:30,108 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-10-22 09:02:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,109 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-10-22 09:02:30,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-10-22 09:02:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:02:30,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,110 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, 1, 1] [2019-10-22 09:02:30,110 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-10-22 09:02:30,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289597425] [2019-10-22 09:02:30,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,149 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 09:02:30,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289597425] [2019-10-22 09:02:30,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:30,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76223652] [2019-10-22 09:02:30,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:30,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,150 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-10-22 09:02:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,267 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-10-22 09:02:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 09:02:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:30,269 INFO L225 Difference]: With dead ends: 634 [2019-10-22 09:02:30,269 INFO L226 Difference]: Without dead ends: 336 [2019-10-22 09:02:30,270 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 09:02:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-22 09:02:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-22 09:02:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-22 09:02:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-10-22 09:02:30,279 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-10-22 09:02:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,280 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-10-22 09:02:30,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-10-22 09:02:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:02:30,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,281 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, 1, 1] [2019-10-22 09:02:30,281 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-10-22 09:02:30,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467125978] [2019-10-22 09:02:30,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,309 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 09:02:30,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467125978] [2019-10-22 09:02:30,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:30,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098828558] [2019-10-22 09:02:30,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:30,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,311 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-10-22 09:02:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,442 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-10-22 09:02:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 09:02:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:30,444 INFO L225 Difference]: With dead ends: 663 [2019-10-22 09:02:30,444 INFO L226 Difference]: Without dead ends: 336 [2019-10-22 09:02:30,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 09:02:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-22 09:02:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-22 09:02:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-22 09:02:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-10-22 09:02:30,454 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-10-22 09:02:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,455 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-10-22 09:02:30,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-10-22 09:02:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:02:30,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,457 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, 1, 1] [2019-10-22 09:02:30,457 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-10-22 09:02:30,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708904941] [2019-10-22 09:02:30,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,498 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 09:02:30,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708904941] [2019-10-22 09:02:30,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:30,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282885588] [2019-10-22 09:02:30,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:30,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,500 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-10-22 09:02:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,622 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-10-22 09:02:30,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 09:02:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:30,624 INFO L225 Difference]: With dead ends: 696 [2019-10-22 09:02:30,624 INFO L226 Difference]: Without dead ends: 369 [2019-10-22 09:02:30,624 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 09:02:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-22 09:02:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-10-22 09:02:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 09:02:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-10-22 09:02:30,635 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-10-22 09:02:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,635 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-10-22 09:02:30,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-10-22 09:02:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:02:30,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,636 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, 1, 1] [2019-10-22 09:02:30,637 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-10-22 09:02:30,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372557225] [2019-10-22 09:02:30,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,672 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 09:02:30,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372557225] [2019-10-22 09:02:30,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:30,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327183521] [2019-10-22 09:02:30,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:30,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,674 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-10-22 09:02:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,801 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-10-22 09:02:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 09:02:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:30,802 INFO L225 Difference]: With dead ends: 723 [2019-10-22 09:02:30,803 INFO L226 Difference]: Without dead ends: 369 [2019-10-22 09:02:30,803 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 09:02:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-22 09:02:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-10-22 09:02:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 09:02:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-10-22 09:02:30,814 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-10-22 09:02:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,814 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-10-22 09:02:30,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-10-22 09:02:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 09:02:30,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,816 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:30,816 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-10-22 09:02:30,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63702941] [2019-10-22 09:02:30,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:02:30,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63702941] [2019-10-22 09:02:30,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:30,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:30,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368918147] [2019-10-22 09:02:30,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:30,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:30,846 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-10-22 09:02:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:30,966 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-10-22 09:02:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:30,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 09:02:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:30,970 INFO L225 Difference]: With dead ends: 740 [2019-10-22 09:02:30,970 INFO L226 Difference]: Without dead ends: 386 [2019-10-22 09:02:30,971 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 09:02:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-22 09:02:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-10-22 09:02:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-22 09:02:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-10-22 09:02:30,986 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-10-22 09:02:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:30,986 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-10-22 09:02:30,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-10-22 09:02:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 09:02:30,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:30,988 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:30,988 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-10-22 09:02:30,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:30,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949419359] [2019-10-22 09:02:30,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:30,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:02:31,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949419359] [2019-10-22 09:02:31,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:31,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:31,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981351155] [2019-10-22 09:02:31,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:31,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:31,036 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-10-22 09:02:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,178 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-10-22 09:02:31,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:31,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 09:02:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:31,180 INFO L225 Difference]: With dead ends: 761 [2019-10-22 09:02:31,180 INFO L226 Difference]: Without dead ends: 386 [2019-10-22 09:02:31,181 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 09:02:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-22 09:02:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-10-22 09:02:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-22 09:02:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-10-22 09:02:31,197 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-10-22 09:02:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:31,198 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-10-22 09:02:31,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-10-22 09:02:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-22 09:02:31,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:31,200 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:31,200 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-10-22 09:02:31,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398651887] [2019-10-22 09:02:31,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 09:02:31,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398651887] [2019-10-22 09:02:31,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:31,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:31,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636528024] [2019-10-22 09:02:31,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:31,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:31,274 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-10-22 09:02:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,316 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-10-22 09:02:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:31,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-22 09:02:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:31,319 INFO L225 Difference]: With dead ends: 757 [2019-10-22 09:02:31,319 INFO L226 Difference]: Without dead ends: 755 [2019-10-22 09:02:31,320 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 09:02:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-22 09:02:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-10-22 09:02:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-22 09:02:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-10-22 09:02:31,344 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-10-22 09:02:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:31,344 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-10-22 09:02:31,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-10-22 09:02:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 09:02:31,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:31,346 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, 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] [2019-10-22 09:02:31,347 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-10-22 09:02:31,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931743213] [2019-10-22 09:02:31,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:02:31,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931743213] [2019-10-22 09:02:31,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:31,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:31,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000177034] [2019-10-22 09:02:31,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:31,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:31,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:31,380 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-10-22 09:02:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,555 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-10-22 09:02:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:31,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-22 09:02:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:31,559 INFO L225 Difference]: With dead ends: 1587 [2019-10-22 09:02:31,559 INFO L226 Difference]: Without dead ends: 839 [2019-10-22 09:02:31,560 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 09:02:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-22 09:02:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-10-22 09:02:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-10-22 09:02:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-10-22 09:02:31,591 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-10-22 09:02:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:31,592 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-10-22 09:02:31,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-10-22 09:02:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-22 09:02:31,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:31,594 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, 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] [2019-10-22 09:02:31,594 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-10-22 09:02:31,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226991047] [2019-10-22 09:02:31,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:02:31,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226991047] [2019-10-22 09:02:31,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:31,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:31,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634334853] [2019-10-22 09:02:31,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:31,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:31,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:31,632 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-10-22 09:02:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:31,804 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-10-22 09:02:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:31,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-22 09:02:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:31,808 INFO L225 Difference]: With dead ends: 1663 [2019-10-22 09:02:31,808 INFO L226 Difference]: Without dead ends: 835 [2019-10-22 09:02:31,810 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 09:02:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-10-22 09:02:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-10-22 09:02:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-10-22 09:02:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-10-22 09:02:31,843 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-10-22 09:02:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:31,844 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-10-22 09:02:31,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-10-22 09:02:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 09:02:31,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:31,847 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, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:31,847 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-10-22 09:02:31,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:31,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542474677] [2019-10-22 09:02:31,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:31,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-22 09:02:31,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542474677] [2019-10-22 09:02:31,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:31,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:31,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948916762] [2019-10-22 09:02:31,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:31,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:31,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:31,894 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-10-22 09:02:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,056 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-10-22 09:02:32,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:32,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 09:02:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,060 INFO L225 Difference]: With dead ends: 1723 [2019-10-22 09:02:32,060 INFO L226 Difference]: Without dead ends: 903 [2019-10-22 09:02:32,061 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 09:02:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-10-22 09:02:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-10-22 09:02:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-22 09:02:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-10-22 09:02:32,090 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-10-22 09:02:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,090 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-10-22 09:02:32,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-10-22 09:02:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-22 09:02:32,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,092 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, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,093 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-10-22 09:02:32,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557086501] [2019-10-22 09:02:32,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-22 09:02:32,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557086501] [2019-10-22 09:02:32,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:32,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146706206] [2019-10-22 09:02:32,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:32,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:32,136 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-10-22 09:02:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,279 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-10-22 09:02:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:32,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-22 09:02:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,282 INFO L225 Difference]: With dead ends: 1795 [2019-10-22 09:02:32,282 INFO L226 Difference]: Without dead ends: 899 [2019-10-22 09:02:32,283 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 09:02:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-22 09:02:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-10-22 09:02:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-22 09:02:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-10-22 09:02:32,309 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-10-22 09:02:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,309 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-10-22 09:02:32,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-10-22 09:02:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-22 09:02:32,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,312 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,312 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-10-22 09:02:32,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486452158] [2019-10-22 09:02:32,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-22 09:02:32,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486452158] [2019-10-22 09:02:32,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:32,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426339195] [2019-10-22 09:02:32,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:32,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:32,354 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-10-22 09:02:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,490 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-10-22 09:02:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:32,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-22 09:02:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,494 INFO L225 Difference]: With dead ends: 1855 [2019-10-22 09:02:32,494 INFO L226 Difference]: Without dead ends: 967 [2019-10-22 09:02:32,495 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 09:02:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-10-22 09:02:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-10-22 09:02:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-10-22 09:02:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-10-22 09:02:32,530 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-10-22 09:02:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,530 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-10-22 09:02:32,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-10-22 09:02:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-22 09:02:32,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,534 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-10-22 09:02:32,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534145181] [2019-10-22 09:02:32,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-22 09:02:32,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534145181] [2019-10-22 09:02:32,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:32,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379606093] [2019-10-22 09:02:32,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:32,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:32,619 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-10-22 09:02:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,759 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-10-22 09:02:32,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:32,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-22 09:02:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,763 INFO L225 Difference]: With dead ends: 1923 [2019-10-22 09:02:32,764 INFO L226 Difference]: Without dead ends: 963 [2019-10-22 09:02:32,765 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 09:02:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-10-22 09:02:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-10-22 09:02:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-10-22 09:02:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-10-22 09:02:32,794 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-10-22 09:02:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,794 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-10-22 09:02:32,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-10-22 09:02:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-22 09:02:32,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,797 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,797 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-10-22 09:02:32,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963387331] [2019-10-22 09:02:32,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-22 09:02:32,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963387331] [2019-10-22 09:02:32,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:32,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744166042] [2019-10-22 09:02:32,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:32,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:32,843 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-10-22 09:02:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,971 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-10-22 09:02:32,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:32,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-10-22 09:02:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,976 INFO L225 Difference]: With dead ends: 1987 [2019-10-22 09:02:32,976 INFO L226 Difference]: Without dead ends: 1035 [2019-10-22 09:02:32,978 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 09:02:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-10-22 09:02:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-10-22 09:02:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-10-22 09:02:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-10-22 09:02:33,013 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-10-22 09:02:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:33,013 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-10-22 09:02:33,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-10-22 09:02:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-22 09:02:33,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:33,016 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,017 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-10-22 09:02:33,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788793601] [2019-10-22 09:02:33,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-22 09:02:33,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788793601] [2019-10-22 09:02:33,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:33,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:33,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927511347] [2019-10-22 09:02:33,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:33,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:33,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:33,070 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-10-22 09:02:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,224 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-10-22 09:02:33,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-22 09:02:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:33,228 INFO L225 Difference]: With dead ends: 2037 [2019-10-22 09:02:33,228 INFO L226 Difference]: Without dead ends: 1035 [2019-10-22 09:02:33,229 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 09:02:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-10-22 09:02:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-10-22 09:02:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-10-22 09:02:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-10-22 09:02:33,265 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-10-22 09:02:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:33,265 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-10-22 09:02:33,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-10-22 09:02:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-22 09:02:33,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:33,268 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,269 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-10-22 09:02:33,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367812738] [2019-10-22 09:02:33,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-22 09:02:33,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367812738] [2019-10-22 09:02:33,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:33,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:33,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730706679] [2019-10-22 09:02:33,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:33,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:33,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:33,322 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-10-22 09:02:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,463 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-10-22 09:02:33,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-22 09:02:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:33,467 INFO L225 Difference]: With dead ends: 2019 [2019-10-22 09:02:33,467 INFO L226 Difference]: Without dead ends: 1017 [2019-10-22 09:02:33,468 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 09:02:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-10-22 09:02:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-10-22 09:02:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-10-22 09:02:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-10-22 09:02:33,500 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-10-22 09:02:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:33,500 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-10-22 09:02:33,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-10-22 09:02:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-22 09:02:33,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:33,504 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,504 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-10-22 09:02:33,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320614467] [2019-10-22 09:02:33,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-22 09:02:33,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320614467] [2019-10-22 09:02:33,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:33,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:33,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516103115] [2019-10-22 09:02:33,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:33,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:33,567 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-10-22 09:02:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,704 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-10-22 09:02:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-22 09:02:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:33,707 INFO L225 Difference]: With dead ends: 2019 [2019-10-22 09:02:33,707 INFO L226 Difference]: Without dead ends: 999 [2019-10-22 09:02:33,709 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 09:02:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-10-22 09:02:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-10-22 09:02:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-10-22 09:02:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-10-22 09:02:33,740 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-10-22 09:02:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:33,740 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-10-22 09:02:33,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-10-22 09:02:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-22 09:02:33,743 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:33,743 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,743 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-10-22 09:02:33,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500123013] [2019-10-22 09:02:33,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-22 09:02:33,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500123013] [2019-10-22 09:02:33,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:33,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:33,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633285943] [2019-10-22 09:02:33,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:33,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:33,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:33,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:33,793 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-10-22 09:02:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,923 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-10-22 09:02:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-10-22 09:02:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:33,927 INFO L225 Difference]: With dead ends: 2029 [2019-10-22 09:02:33,927 INFO L226 Difference]: Without dead ends: 1045 [2019-10-22 09:02:33,928 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 09:02:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-10-22 09:02:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-10-22 09:02:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-10-22 09:02:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-10-22 09:02:33,962 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-10-22 09:02:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:33,962 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-10-22 09:02:33,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-10-22 09:02:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-22 09:02:33,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:33,965 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,965 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-10-22 09:02:33,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426516974] [2019-10-22 09:02:33,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-22 09:02:34,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426516974] [2019-10-22 09:02:34,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:34,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:34,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51807173] [2019-10-22 09:02:34,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:34,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:34,012 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-10-22 09:02:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:34,147 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-10-22 09:02:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:34,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-22 09:02:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:34,151 INFO L225 Difference]: With dead ends: 2075 [2019-10-22 09:02:34,151 INFO L226 Difference]: Without dead ends: 1037 [2019-10-22 09:02:34,152 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 09:02:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-10-22 09:02:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-10-22 09:02:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-10-22 09:02:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-10-22 09:02:34,186 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-10-22 09:02:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:34,186 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-10-22 09:02:34,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-10-22 09:02:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-22 09:02:34,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:34,189 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:34,189 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-10-22 09:02:34,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714196281] [2019-10-22 09:02:34,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-22 09:02:34,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714196281] [2019-10-22 09:02:34,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257339299] [2019-10-22 09:02:34,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/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 09:02:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:34,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-22 09:02:34,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:02:34,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:02:34,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182956293] [2019-10-22 09:02:34,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:34,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:34,442 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 3 states. [2019-10-22 09:02:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:34,518 INFO L93 Difference]: Finished difference Result 2561 states and 3720 transitions. [2019-10-22 09:02:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:34,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-22 09:02:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:34,523 INFO L225 Difference]: With dead ends: 2561 [2019-10-22 09:02:34,523 INFO L226 Difference]: Without dead ends: 1539 [2019-10-22 09:02:34,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 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 09:02:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-10-22 09:02:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2019-10-22 09:02:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-10-22 09:02:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2235 transitions. [2019-10-22 09:02:34,591 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2235 transitions. Word has length 261 [2019-10-22 09:02:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:34,592 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 2235 transitions. [2019-10-22 09:02:34,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2235 transitions. [2019-10-22 09:02:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-22 09:02:34,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:34,596 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:34,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:34,797 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-10-22 09:02:34,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:34,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722456989] [2019-10-22 09:02:34,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:34,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-22 09:02:34,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722456989] [2019-10-22 09:02:34,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:34,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:34,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213371287] [2019-10-22 09:02:34,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:34,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:34,964 INFO L87 Difference]: Start difference. First operand 1539 states and 2235 transitions. Second operand 3 states. [2019-10-22 09:02:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:35,052 INFO L93 Difference]: Finished difference Result 4522 states and 6563 transitions. [2019-10-22 09:02:35,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:35,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-10-22 09:02:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:35,063 INFO L225 Difference]: With dead ends: 4522 [2019-10-22 09:02:35,063 INFO L226 Difference]: Without dead ends: 2990 [2019-10-22 09:02:35,066 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 09:02:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-10-22 09:02:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2988. [2019-10-22 09:02:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-10-22 09:02:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4329 transitions. [2019-10-22 09:02:35,181 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4329 transitions. Word has length 268 [2019-10-22 09:02:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:35,182 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 4329 transitions. [2019-10-22 09:02:35,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4329 transitions. [2019-10-22 09:02:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-22 09:02:35,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:35,189 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 09:02:35,190 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-10-22 09:02:35,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874835135] [2019-10-22 09:02:35,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-22 09:02:35,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874835135] [2019-10-22 09:02:35,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:35,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:35,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575922112] [2019-10-22 09:02:35,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:35,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:35,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:35,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:35,284 INFO L87 Difference]: Start difference. First operand 2988 states and 4329 transitions. Second operand 3 states. [2019-10-22 09:02:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:35,489 INFO L93 Difference]: Finished difference Result 6089 states and 8839 transitions. [2019-10-22 09:02:35,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:35,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-22 09:02:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:35,496 INFO L225 Difference]: With dead ends: 6089 [2019-10-22 09:02:35,496 INFO L226 Difference]: Without dead ends: 1991 [2019-10-22 09:02:35,500 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 09:02:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-10-22 09:02:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1971. [2019-10-22 09:02:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-10-22 09:02:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2807 transitions. [2019-10-22 09:02:35,568 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2807 transitions. Word has length 305 [2019-10-22 09:02:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:35,568 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2807 transitions. [2019-10-22 09:02:35,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2807 transitions. [2019-10-22 09:02:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-22 09:02:35,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:35,574 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:02:35,575 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:35,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1127702344, now seen corresponding path program 1 times [2019-10-22 09:02:35,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:35,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475607068] [2019-10-22 09:02:35,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:35,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-22 09:02:35,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475607068] [2019-10-22 09:02:35,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278862614] [2019-10-22 09:02:35,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/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 09:02:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:35,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:35,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-22 09:02:35,925 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:35,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:35,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634643201] [2019-10-22 09:02:35,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:35,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:35,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:35,927 INFO L87 Difference]: Start difference. First operand 1971 states and 2807 transitions. Second operand 4 states. [2019-10-22 09:02:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:36,223 INFO L93 Difference]: Finished difference Result 4561 states and 6484 transitions. [2019-10-22 09:02:36,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:36,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-10-22 09:02:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:36,235 INFO L225 Difference]: With dead ends: 4561 [2019-10-22 09:02:36,240 INFO L226 Difference]: Without dead ends: 2553 [2019-10-22 09:02:36,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 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 09:02:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-10-22 09:02:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 1942. [2019-10-22 09:02:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-10-22 09:02:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-10-22 09:02:36,316 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 371 [2019-10-22 09:02:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:36,317 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-10-22 09:02:36,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-10-22 09:02:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-10-22 09:02:36,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:36,329 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 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] [2019-10-22 09:02:36,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:36,531 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-10-22 09:02:36,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665923191] [2019-10-22 09:02:36,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-22 09:02:36,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665923191] [2019-10-22 09:02:36,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988892136] [2019-10-22 09:02:36,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/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 09:02:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:36,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-22 09:02:37,205 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:37,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:37,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102107893] [2019-10-22 09:02:37,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:37,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:37,208 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-10-22 09:02:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:37,492 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-10-22 09:02:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:37,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-10-22 09:02:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:37,504 INFO L225 Difference]: With dead ends: 4797 [2019-10-22 09:02:37,504 INFO L226 Difference]: Without dead ends: 2724 [2019-10-22 09:02:37,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 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 09:02:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-10-22 09:02:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-10-22 09:02:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-10-22 09:02:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-10-22 09:02:37,588 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-10-22 09:02:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:37,589 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-10-22 09:02:37,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-10-22 09:02:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-10-22 09:02:37,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:37,604 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:37,805 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-10-22 09:02:37,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642223329] [2019-10-22 09:02:37,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-10-22 09:02:38,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642223329] [2019-10-22 09:02:38,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:38,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:38,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526255222] [2019-10-22 09:02:38,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:38,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:38,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:38,089 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-10-22 09:02:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:38,262 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-10-22 09:02:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:38,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-10-22 09:02:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:38,277 INFO L225 Difference]: With dead ends: 3917 [2019-10-22 09:02:38,279 INFO L226 Difference]: Without dead ends: 1982 [2019-10-22 09:02:38,281 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 09:02:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-10-22 09:02:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-10-22 09:02:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-10-22 09:02:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-10-22 09:02:38,349 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-10-22 09:02:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:38,350 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-10-22 09:02:38,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-10-22 09:02:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-10-22 09:02:38,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:38,366 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:38,366 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:38,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-10-22 09:02:38,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061895770] [2019-10-22 09:02:38,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-10-22 09:02:38,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061895770] [2019-10-22 09:02:38,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:38,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:38,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69640320] [2019-10-22 09:02:38,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:38,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:38,663 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-10-22 09:02:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:38,868 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-10-22 09:02:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:38,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-10-22 09:02:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:38,873 INFO L225 Difference]: With dead ends: 3892 [2019-10-22 09:02:38,873 INFO L226 Difference]: Without dead ends: 1957 [2019-10-22 09:02:38,876 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 09:02:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-10-22 09:02:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-10-22 09:02:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-10-22 09:02:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-10-22 09:02:38,946 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-10-22 09:02:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:38,947 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-10-22 09:02:38,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-10-22 09:02:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-10-22 09:02:38,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:38,955 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:38,956 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:38,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-10-22 09:02:38,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051957239] [2019-10-22 09:02:38,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-10-22 09:02:39,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051957239] [2019-10-22 09:02:39,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:39,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:39,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152304282] [2019-10-22 09:02:39,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:39,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:39,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:39,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:39,257 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-10-22 09:02:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:39,406 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-10-22 09:02:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:39,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-10-22 09:02:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:39,410 INFO L225 Difference]: With dead ends: 3921 [2019-10-22 09:02:39,410 INFO L226 Difference]: Without dead ends: 1981 [2019-10-22 09:02:39,412 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 09:02:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-10-22 09:02:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-10-22 09:02:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-10-22 09:02:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-10-22 09:02:39,467 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-10-22 09:02:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:39,468 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-10-22 09:02:39,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-10-22 09:02:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-10-22 09:02:39,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:39,473 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:39,473 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-10-22 09:02:39,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680754430] [2019-10-22 09:02:39,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-10-22 09:02:39,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680754430] [2019-10-22 09:02:39,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:39,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:39,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507190770] [2019-10-22 09:02:39,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:39,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:39,782 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-10-22 09:02:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:39,897 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-10-22 09:02:39,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:39,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-10-22 09:02:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:39,898 INFO L225 Difference]: With dead ends: 2519 [2019-10-22 09:02:39,898 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:02:39,900 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 09:02:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:02:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:02:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:02:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:02:39,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-10-22 09:02:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:39,901 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:39,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:39,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:02:39,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:02:40,443 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-10-22 09:02:40,669 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-10-22 09:02:41,039 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-10-22 09:02:41,386 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-10-22 09:02:41,735 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:42,028 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:42,338 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-10-22 09:02:42,561 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-10-22 09:02:42,939 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:43,299 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-10-22 09:02:43,610 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:43,990 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:44,362 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-10-22 09:02:44,586 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-10-22 09:02:44,837 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:45,258 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-10-22 09:02:45,498 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:45,884 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-10-22 09:02:46,075 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-10-22 09:02:46,274 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-22 09:02:46,461 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-10-22 09:02:46,694 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-10-22 09:02:46,696 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-10-22 09:02:46,696 INFO L443 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-10-22 09:02:46,696 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 545) no Hoare annotation was computed. [2019-10-22 09:02:46,696 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 556) no Hoare annotation was computed. [2019-10-22 09:02:46,696 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 567) no Hoare annotation was computed. [2019-10-22 09:02:46,696 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 578) no Hoare annotation was computed. [2019-10-22 09:02:46,697 INFO L446 ceAbstractionStarter]: At program point L598(lines 98 599) the Hoare annotation is: true [2019-10-22 09:02:46,698 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-10-22 09:02:46,698 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-10-22 09:02:46,698 INFO L443 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-10-22 09:02:46,698 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-10-22 09:02:46,698 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-10-22 09:02:46,699 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 578) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-10-22 09:02:46,699 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 544) no Hoare annotation was computed. [2019-10-22 09:02:46,699 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 555) no Hoare annotation was computed. [2019-10-22 09:02:46,699 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 566) no Hoare annotation was computed. [2019-10-22 09:02:46,699 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 577) no Hoare annotation was computed. [2019-10-22 09:02:46,699 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-10-22 09:02:46,699 INFO L443 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-10-22 09:02:46,699 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 09:02:46,700 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-10-22 09:02:46,700 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11)))) [2019-10-22 09:02:46,700 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-10-22 09:02:46,700 INFO L443 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-10-22 09:02:46,700 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-10-22 09:02:46,700 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-10-22 09:02:46,700 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-10-22 09:02:46,700 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 554) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 565) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 576) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 208 541) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 553) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 564) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 575) no Hoare annotation was computed. [2019-10-22 09:02:46,701 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-10-22 09:02:46,702 INFO L443 ceAbstractionStarter]: For program point L475-2(lines 208 541) no Hoare annotation was computed. [2019-10-22 09:02:46,702 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-10-22 09:02:46,702 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-10-22 09:02:46,702 INFO L439 ceAbstractionStarter]: At program point L211(lines 105 577) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,702 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 554) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,703 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 565) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,703 INFO L446 ceAbstractionStarter]: At program point L608(lines 11 610) the Hoare annotation is: true [2019-10-22 09:02:46,704 INFO L439 ceAbstractionStarter]: At program point L542(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,704 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-10-22 09:02:46,704 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-10-22 09:02:46,704 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 552) no Hoare annotation was computed. [2019-10-22 09:02:46,704 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 563) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 574) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L439 ceAbstractionStarter]: At program point L513(lines 72 609) the Hoare annotation is: false [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 551) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 562) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 573) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-10-22 09:02:46,705 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-10-22 09:02:46,706 INFO L443 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-10-22 09:02:46,706 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 552) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,706 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 563) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,706 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-10-22 09:02:46,706 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-10-22 09:02:46,706 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-10-22 09:02:46,706 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-10-22 09:02:46,707 INFO L443 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-10-22 09:02:46,707 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-10-22 09:02:46,707 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:02:46,708 INFO L439 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,708 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 550) no Hoare annotation was computed. [2019-10-22 09:02:46,708 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 561) no Hoare annotation was computed. [2019-10-22 09:02:46,708 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 572) no Hoare annotation was computed. [2019-10-22 09:02:46,708 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-10-22 09:02:46,708 INFO L443 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-10-22 09:02:46,708 INFO L439 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,709 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 573) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L287-2(lines 208 541) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-10-22 09:02:46,709 INFO L443 ceAbstractionStarter]: For program point L321-2(lines 208 541) no Hoare annotation was computed. [2019-10-22 09:02:46,710 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 549) no Hoare annotation was computed. [2019-10-22 09:02:46,710 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 560) no Hoare annotation was computed. [2019-10-22 09:02:46,710 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 571) no Hoare annotation was computed. [2019-10-22 09:02:46,710 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-10-22 09:02:46,710 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 72 609) no Hoare annotation was computed. [2019-10-22 09:02:46,710 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-10-22 09:02:46,711 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:02:46,711 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 550) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,711 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,711 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 571) 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 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L446 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 548) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 559) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 570) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L226-2(lines 208 541) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:02:46,712 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 547) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 558) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 569) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-10-22 09:02:46,713 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 548) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21))) [2019-10-22 09:02:46,714 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.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 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-10-22 09:02:46,714 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-10-22 09:02:46,714 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-10-22 09:02:46,714 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 546) no Hoare annotation was computed. [2019-10-22 09:02:46,714 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 557) no Hoare annotation was computed. [2019-10-22 09:02:46,714 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 568) no Hoare annotation was computed. [2019-10-22 09:02:46,714 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,714 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-10-22 09:02:46,715 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-10-22 09:02:46,715 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-10-22 09:02:46,715 INFO L443 ceAbstractionStarter]: For program point L496-2(lines 208 541) no Hoare annotation was computed. [2019-10-22 09:02:46,716 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,716 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-10-22 09:02:46,716 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 557) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-10-22 09:02:46,716 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 570) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:02:46,717 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 09:02:46,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:46 BoogieIcfgContainer [2019-10-22 09:02:46,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:46,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:46,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:46,768 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:46,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:27" (3/4) ... [2019-10-22 09:02:46,774 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:02:46,792 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:02:46,794 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:02:46,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_16da5375-cbaa-406c-8c58-cd0de89f9d43/bin/uautomizer/witness.graphml [2019-10-22 09:02:46,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:46,911 INFO L168 Benchmark]: Toolchain (without parser) took 20668.92 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -211.3 MB). Peak memory consumption was 888.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,912 INFO L168 Benchmark]: CDTParser took 0.18 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 09:02:46,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,912 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:46,912 INFO L168 Benchmark]: RCFGBuilder took 715.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,913 INFO L168 Benchmark]: TraceAbstraction took 19261.67 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 985.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -153.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,913 INFO L168 Benchmark]: Witness Printer took 142.80 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,914 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.18 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 476.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 715.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19261.67 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 985.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -153.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 142.80 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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: ((((((((((((((((blastFlag <= 2 && 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)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__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__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) - 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: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - 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 == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(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 == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 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 == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 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) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(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 == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 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 == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 8448 <= s__state) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(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))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || (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 <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || s__state <= 3) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(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))) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((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)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 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)) || ((((((((((((((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) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 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)) || (((((((((((((((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) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(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)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 19.1s, OverallIterations: 36, TraceHistogramMax: 25, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, HoareTripleCheckerStatistics: 5516 SDtfs, 4845 SDslu, 1841 SDs, 0 SdLazy, 3378 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1317 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2988occurred in iteration=29, 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, 36 MinimizatonAttempts, 1659 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 207 NumberOfFragments, 3523 HoareAnnotationTreeSize, 28 FomulaSimplifications, 29289 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7804 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 9347 NumberOfCodeBlocks, 9347 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9308 ConstructedInterpolants, 0 QuantifiedInterpolants, 4566453 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 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...