./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.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/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/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 49452e318e3c9c4b1e038ab7778998d33b04e5b2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:17:21,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:17:21,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:17:21,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:17:21,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:17:21,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:17:21,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:17:21,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:17:21,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:17:21,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:17:21,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:17:21,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:17:21,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:17:21,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:17:21,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:17:21,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:17:21,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:17:21,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:17:21,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:17:21,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:17:21,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:17:21,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:17:21,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:17:21,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:17:21,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:17:21,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:17:21,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:17:21,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:17:21,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:17:21,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:17:21,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:17:21,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:17:21,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:17:21,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:17:21,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:17:21,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:17:21,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:17:21,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:17:21,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:17:21,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:17:21,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:17:21,747 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:17:21,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:17:21,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:17:21,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:17:21,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:17:21,763 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:17:21,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:17:21,764 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:17:21,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:17:21,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:17:21,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:17:21,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:17:21,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:17:21,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:17:21,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:17:21,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:17:21,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:17:21,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:17:21,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:17:21,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:17:21,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:17:21,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:17:21,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:17:21,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:17:21,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:17:21,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:17:21,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:17:21,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:17:21,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:17:21,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/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 -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-16 00:17:21,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:17:21,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:17:21,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:17:21,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:17:21,811 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:17:21,812 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-16 00:17:21,867 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/data/ccf2c0cfc/2f895e205e6c40e4b64f3b8e2812a58d/FLAG921892317 [2019-11-16 00:17:22,241 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:17:22,242 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-16 00:17:22,263 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/data/ccf2c0cfc/2f895e205e6c40e4b64f3b8e2812a58d/FLAG921892317 [2019-11-16 00:17:22,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/data/ccf2c0cfc/2f895e205e6c40e4b64f3b8e2812a58d [2019-11-16 00:17:22,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:17:22,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:17:22,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:22,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:17:22,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:17:22,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:22" (1/1) ... [2019-11-16 00:17:22,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1222938d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:22, skipping insertion in model container [2019-11-16 00:17:22,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:22" (1/1) ... [2019-11-16 00:17:22,623 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:17:22,679 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:17:22,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:22,977 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:17:23,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:17:23,084 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:17:23,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23 WrapperNode [2019-11-16 00:17:23,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:17:23,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:17:23,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:17:23,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:17:23,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:17:23,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:17:23,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:17:23,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:17:23,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... [2019-11-16 00:17:23,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:17:23,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:17:23,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:17:23,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:17:23,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/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-11-16 00:17:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:17:23,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:17:23,373 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:17:23,919 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-16 00:17:23,919 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-16 00:17:23,920 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:17:23,921 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:17:23,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:23 BoogieIcfgContainer [2019-11-16 00:17:23,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:17:23,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:17:23,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:17:23,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:17:23,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:22" (1/3) ... [2019-11-16 00:17:23,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7112c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:23, skipping insertion in model container [2019-11-16 00:17:23,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:23" (2/3) ... [2019-11-16 00:17:23,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7112c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:23, skipping insertion in model container [2019-11-16 00:17:23,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:23" (3/3) ... [2019-11-16 00:17:23,931 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-16 00:17:23,939 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:17:23,946 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:17:23,956 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:17:23,978 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:17:23,978 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:17:23,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:17:23,979 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:17:23,979 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:17:23,979 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:17:23,979 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:17:23,979 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:17:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-16 00:17:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:17:24,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:24,007 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-11-16 00:17:24,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -91611738, now seen corresponding path program 1 times [2019-11-16 00:17:24,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:24,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627690479] [2019-11-16 00:17:24,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:24,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627690479] [2019-11-16 00:17:24,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:24,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:24,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011756195] [2019-11-16 00:17:24,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:24,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:24,226 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-11-16 00:17:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:24,507 INFO L93 Difference]: Finished difference Result 327 states and 564 transitions. [2019-11-16 00:17:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:24,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-16 00:17:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:24,532 INFO L225 Difference]: With dead ends: 327 [2019-11-16 00:17:24,532 INFO L226 Difference]: Without dead ends: 173 [2019-11-16 00:17:24,537 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-11-16 00:17:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-16 00:17:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2019-11-16 00:17:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-16 00:17:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 273 transitions. [2019-11-16 00:17:24,585 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 273 transitions. Word has length 43 [2019-11-16 00:17:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:24,586 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 273 transitions. [2019-11-16 00:17:24,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 273 transitions. [2019-11-16 00:17:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:17:24,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:24,589 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-11-16 00:17:24,590 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1448027309, now seen corresponding path program 1 times [2019-11-16 00:17:24,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:24,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525000938] [2019-11-16 00:17:24,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:24,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525000938] [2019-11-16 00:17:24,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:24,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:24,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669828787] [2019-11-16 00:17:24,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:24,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:24,667 INFO L87 Difference]: Start difference. First operand 167 states and 273 transitions. Second operand 3 states. [2019-11-16 00:17:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:24,885 INFO L93 Difference]: Finished difference Result 376 states and 623 transitions. [2019-11-16 00:17:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:24,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-16 00:17:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:24,887 INFO L225 Difference]: With dead ends: 376 [2019-11-16 00:17:24,888 INFO L226 Difference]: Without dead ends: 214 [2019-11-16 00:17:24,889 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-11-16 00:17:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-16 00:17:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-11-16 00:17:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-16 00:17:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 350 transitions. [2019-11-16 00:17:24,914 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 350 transitions. Word has length 44 [2019-11-16 00:17:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:24,915 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 350 transitions. [2019-11-16 00:17:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 350 transitions. [2019-11-16 00:17:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:17:24,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:24,924 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, 1] [2019-11-16 00:17:24,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1909160843, now seen corresponding path program 1 times [2019-11-16 00:17:24,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:24,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138915656] [2019-11-16 00:17:24,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:24,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:25,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138915656] [2019-11-16 00:17:25,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:25,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:25,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909307108] [2019-11-16 00:17:25,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:25,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:25,055 INFO L87 Difference]: Start difference. First operand 208 states and 350 transitions. Second operand 3 states. [2019-11-16 00:17:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:25,256 INFO L93 Difference]: Finished difference Result 440 states and 747 transitions. [2019-11-16 00:17:25,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:25,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-16 00:17:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:25,259 INFO L225 Difference]: With dead ends: 440 [2019-11-16 00:17:25,259 INFO L226 Difference]: Without dead ends: 239 [2019-11-16 00:17:25,260 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-11-16 00:17:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-16 00:17:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-11-16 00:17:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-16 00:17:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 406 transitions. [2019-11-16 00:17:25,279 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 406 transitions. Word has length 72 [2019-11-16 00:17:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:25,280 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 406 transitions. [2019-11-16 00:17:25,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 406 transitions. [2019-11-16 00:17:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:17:25,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:25,284 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-11-16 00:17:25,284 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:25,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:25,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1091248829, now seen corresponding path program 1 times [2019-11-16 00:17:25,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:25,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080904715] [2019-11-16 00:17:25,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:25,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080904715] [2019-11-16 00:17:25,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:25,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:25,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596673028] [2019-11-16 00:17:25,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:25,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:25,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:25,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:25,363 INFO L87 Difference]: Start difference. First operand 239 states and 406 transitions. Second operand 3 states. [2019-11-16 00:17:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:25,594 INFO L93 Difference]: Finished difference Result 517 states and 883 transitions. [2019-11-16 00:17:25,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:25,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-16 00:17:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:25,597 INFO L225 Difference]: With dead ends: 517 [2019-11-16 00:17:25,597 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:17:25,598 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-11-16 00:17:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:17:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-16 00:17:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-16 00:17:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 481 transitions. [2019-11-16 00:17:25,623 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 481 transitions. Word has length 83 [2019-11-16 00:17:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:25,624 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 481 transitions. [2019-11-16 00:17:25,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 481 transitions. [2019-11-16 00:17:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:17:25,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:25,627 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, 1] [2019-11-16 00:17:25,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash 448380383, now seen corresponding path program 1 times [2019-11-16 00:17:25,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:25,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913344244] [2019-11-16 00:17:25,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:17:25,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913344244] [2019-11-16 00:17:25,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:25,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:25,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736486134] [2019-11-16 00:17:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:25,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:25,702 INFO L87 Difference]: Start difference. First operand 281 states and 481 transitions. Second operand 3 states. [2019-11-16 00:17:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:25,834 INFO L93 Difference]: Finished difference Result 572 states and 979 transitions. [2019-11-16 00:17:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:25,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-16 00:17:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:25,837 INFO L225 Difference]: With dead ends: 572 [2019-11-16 00:17:25,837 INFO L226 Difference]: Without dead ends: 298 [2019-11-16 00:17:25,837 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-11-16 00:17:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-16 00:17:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-16 00:17:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-16 00:17:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 503 transitions. [2019-11-16 00:17:25,854 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 503 transitions. Word has length 84 [2019-11-16 00:17:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:25,854 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 503 transitions. [2019-11-16 00:17:25,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 503 transitions. [2019-11-16 00:17:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:17:25,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:25,857 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-11-16 00:17:25,858 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:25,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:25,858 INFO L82 PathProgramCache]: Analyzing trace with hash 429685604, now seen corresponding path program 1 times [2019-11-16 00:17:25,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:25,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538054097] [2019-11-16 00:17:25,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:25,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:17:25,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538054097] [2019-11-16 00:17:25,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:25,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:25,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218068096] [2019-11-16 00:17:25,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:25,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:25,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:25,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:25,903 INFO L87 Difference]: Start difference. First operand 296 states and 503 transitions. Second operand 3 states. [2019-11-16 00:17:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:26,106 INFO L93 Difference]: Finished difference Result 589 states and 1000 transitions. [2019-11-16 00:17:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:26,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-16 00:17:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:26,109 INFO L225 Difference]: With dead ends: 589 [2019-11-16 00:17:26,109 INFO L226 Difference]: Without dead ends: 298 [2019-11-16 00:17:26,109 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-11-16 00:17:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-16 00:17:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-16 00:17:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-16 00:17:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-11-16 00:17:26,121 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-11-16 00:17:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:26,121 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-11-16 00:17:26,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-11-16 00:17:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:17:26,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:26,123 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, 1] [2019-11-16 00:17:26,123 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:26,124 INFO L82 PathProgramCache]: Analyzing trace with hash -52731309, now seen corresponding path program 1 times [2019-11-16 00:17:26,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:26,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091091211] [2019-11-16 00:17:26,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:17:26,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091091211] [2019-11-16 00:17:26,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:26,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:26,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936649975] [2019-11-16 00:17:26,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:26,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:26,165 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 3 states. [2019-11-16 00:17:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:26,300 INFO L93 Difference]: Finished difference Result 583 states and 987 transitions. [2019-11-16 00:17:26,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:26,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-16 00:17:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:26,302 INFO L225 Difference]: With dead ends: 583 [2019-11-16 00:17:26,303 INFO L226 Difference]: Without dead ends: 296 [2019-11-16 00:17:26,303 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-11-16 00:17:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-16 00:17:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-16 00:17:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-16 00:17:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 494 transitions. [2019-11-16 00:17:26,316 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 494 transitions. Word has length 85 [2019-11-16 00:17:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:26,316 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 494 transitions. [2019-11-16 00:17:26,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 494 transitions. [2019-11-16 00:17:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:17:26,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:26,318 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, 1] [2019-11-16 00:17:26,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash -825774373, now seen corresponding path program 1 times [2019-11-16 00:17:26,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:26,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098809312] [2019-11-16 00:17:26,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-16 00:17:26,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098809312] [2019-11-16 00:17:26,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:26,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:26,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373204255] [2019-11-16 00:17:26,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:26,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:26,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:26,393 INFO L87 Difference]: Start difference. First operand 294 states and 494 transitions. Second operand 3 states. [2019-11-16 00:17:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:26,508 INFO L93 Difference]: Finished difference Result 589 states and 988 transitions. [2019-11-16 00:17:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:26,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-16 00:17:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:26,510 INFO L225 Difference]: With dead ends: 589 [2019-11-16 00:17:26,510 INFO L226 Difference]: Without dead ends: 302 [2019-11-16 00:17:26,511 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-11-16 00:17:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-16 00:17:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-11-16 00:17:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-16 00:17:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 499 transitions. [2019-11-16 00:17:26,525 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 499 transitions. Word has length 97 [2019-11-16 00:17:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 499 transitions. [2019-11-16 00:17:26,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 499 transitions. [2019-11-16 00:17:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:17:26,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:26,527 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, 1] [2019-11-16 00:17:26,527 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1871019140, now seen corresponding path program 1 times [2019-11-16 00:17:26,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:26,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678276305] [2019-11-16 00:17:26,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:17:26,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678276305] [2019-11-16 00:17:26,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:26,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:26,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505849092] [2019-11-16 00:17:26,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:26,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:26,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:26,594 INFO L87 Difference]: Start difference. First operand 302 states and 499 transitions. Second operand 3 states. [2019-11-16 00:17:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:26,754 INFO L93 Difference]: Finished difference Result 628 states and 1040 transitions. [2019-11-16 00:17:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:26,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-16 00:17:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:26,756 INFO L225 Difference]: With dead ends: 628 [2019-11-16 00:17:26,756 INFO L226 Difference]: Without dead ends: 333 [2019-11-16 00:17:26,757 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-11-16 00:17:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-16 00:17:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-11-16 00:17:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-16 00:17:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 546 transitions. [2019-11-16 00:17:26,770 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 546 transitions. Word has length 98 [2019-11-16 00:17:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:26,771 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 546 transitions. [2019-11-16 00:17:26,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 546 transitions. [2019-11-16 00:17:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:17:26,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:26,773 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-11-16 00:17:26,773 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1449457736, now seen corresponding path program 1 times [2019-11-16 00:17:26,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:26,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036922506] [2019-11-16 00:17:26,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:26,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:17:26,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036922506] [2019-11-16 00:17:26,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:26,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:26,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762624962] [2019-11-16 00:17:26,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:26,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:26,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:26,820 INFO L87 Difference]: Start difference. First operand 331 states and 546 transitions. Second operand 3 states. [2019-11-16 00:17:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:26,987 INFO L93 Difference]: Finished difference Result 689 states and 1140 transitions. [2019-11-16 00:17:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:26,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-16 00:17:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:26,990 INFO L225 Difference]: With dead ends: 689 [2019-11-16 00:17:26,990 INFO L226 Difference]: Without dead ends: 365 [2019-11-16 00:17:26,991 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-11-16 00:17:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-16 00:17:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-16 00:17:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-16 00:17:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 588 transitions. [2019-11-16 00:17:27,003 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 588 transitions. Word has length 99 [2019-11-16 00:17:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,004 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 588 transitions. [2019-11-16 00:17:27,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 588 transitions. [2019-11-16 00:17:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:17:27,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,005 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, 1] [2019-11-16 00:17:27,006 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1215142768, now seen corresponding path program 1 times [2019-11-16 00:17:27,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732377351] [2019-11-16 00:17:27,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:17:27,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732377351] [2019-11-16 00:17:27,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:27,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573550731] [2019-11-16 00:17:27,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:27,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:27,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:27,040 INFO L87 Difference]: Start difference. First operand 358 states and 588 transitions. Second operand 3 states. [2019-11-16 00:17:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:27,194 INFO L93 Difference]: Finished difference Result 711 states and 1167 transitions. [2019-11-16 00:17:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:27,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-16 00:17:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:27,197 INFO L225 Difference]: With dead ends: 711 [2019-11-16 00:17:27,197 INFO L226 Difference]: Without dead ends: 360 [2019-11-16 00:17:27,197 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-11-16 00:17:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-16 00:17:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2019-11-16 00:17:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-16 00:17:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 584 transitions. [2019-11-16 00:17:27,210 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 584 transitions. Word has length 99 [2019-11-16 00:17:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,210 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 584 transitions. [2019-11-16 00:17:27,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 584 transitions. [2019-11-16 00:17:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:17:27,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,212 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-11-16 00:17:27,212 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -32577404, now seen corresponding path program 1 times [2019-11-16 00:17:27,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039069881] [2019-11-16 00:17:27,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:17:27,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039069881] [2019-11-16 00:17:27,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:27,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77854168] [2019-11-16 00:17:27,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:27,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:27,248 INFO L87 Difference]: Start difference. First operand 358 states and 584 transitions. Second operand 3 states. [2019-11-16 00:17:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:27,392 INFO L93 Difference]: Finished difference Result 716 states and 1169 transitions. [2019-11-16 00:17:27,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:27,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-16 00:17:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:27,395 INFO L225 Difference]: With dead ends: 716 [2019-11-16 00:17:27,395 INFO L226 Difference]: Without dead ends: 365 [2019-11-16 00:17:27,396 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-11-16 00:17:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-16 00:17:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-16 00:17:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-16 00:17:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 579 transitions. [2019-11-16 00:17:27,410 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 579 transitions. Word has length 100 [2019-11-16 00:17:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,411 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 579 transitions. [2019-11-16 00:17:27,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 579 transitions. [2019-11-16 00:17:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-16 00:17:27,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,412 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-11-16 00:17:27,413 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1057958359, now seen corresponding path program 1 times [2019-11-16 00:17:27,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889795736] [2019-11-16 00:17:27,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:17:27,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889795736] [2019-11-16 00:17:27,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:27,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097143373] [2019-11-16 00:17:27,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:27,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:27,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:27,455 INFO L87 Difference]: Start difference. First operand 358 states and 579 transitions. Second operand 3 states. [2019-11-16 00:17:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:27,593 INFO L93 Difference]: Finished difference Result 734 states and 1188 transitions. [2019-11-16 00:17:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:27,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-16 00:17:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:27,597 INFO L225 Difference]: With dead ends: 734 [2019-11-16 00:17:27,597 INFO L226 Difference]: Without dead ends: 383 [2019-11-16 00:17:27,598 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-11-16 00:17:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-16 00:17:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-16 00:17:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-16 00:17:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 608 transitions. [2019-11-16 00:17:27,612 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 608 transitions. Word has length 104 [2019-11-16 00:17:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,612 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 608 transitions. [2019-11-16 00:17:27,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2019-11-16 00:17:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:17:27,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,614 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-11-16 00:17:27,614 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash -278357315, now seen corresponding path program 1 times [2019-11-16 00:17:27,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068639447] [2019-11-16 00:17:27,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:17:27,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068639447] [2019-11-16 00:17:27,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:27,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857562755] [2019-11-16 00:17:27,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:27,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:27,651 INFO L87 Difference]: Start difference. First operand 379 states and 608 transitions. Second operand 3 states. [2019-11-16 00:17:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:27,782 INFO L93 Difference]: Finished difference Result 755 states and 1211 transitions. [2019-11-16 00:17:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:27,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-16 00:17:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:27,785 INFO L225 Difference]: With dead ends: 755 [2019-11-16 00:17:27,785 INFO L226 Difference]: Without dead ends: 383 [2019-11-16 00:17:27,786 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-11-16 00:17:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-16 00:17:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-16 00:17:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-16 00:17:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2019-11-16 00:17:27,800 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 105 [2019-11-16 00:17:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,801 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2019-11-16 00:17:27,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2019-11-16 00:17:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-16 00:17:27,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,802 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-11-16 00:17:27,803 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash 138382894, now seen corresponding path program 1 times [2019-11-16 00:17:27,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810109739] [2019-11-16 00:17:27,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:17:27,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810109739] [2019-11-16 00:17:27,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:27,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910187357] [2019-11-16 00:17:27,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:27,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:27,840 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand 3 states. [2019-11-16 00:17:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:27,886 INFO L93 Difference]: Finished difference Result 1117 states and 1778 transitions. [2019-11-16 00:17:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:27,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-16 00:17:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:27,890 INFO L225 Difference]: With dead ends: 1117 [2019-11-16 00:17:27,891 INFO L226 Difference]: Without dead ends: 745 [2019-11-16 00:17:27,891 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-11-16 00:17:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-16 00:17:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-16 00:17:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-16 00:17:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1181 transitions. [2019-11-16 00:17:27,926 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1181 transitions. Word has length 120 [2019-11-16 00:17:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:27,927 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1181 transitions. [2019-11-16 00:17:27,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1181 transitions. [2019-11-16 00:17:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-16 00:17:27,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:27,929 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-11-16 00:17:27,929 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2017513840, now seen corresponding path program 1 times [2019-11-16 00:17:27,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:27,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768940456] [2019-11-16 00:17:27,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-16 00:17:27,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768940456] [2019-11-16 00:17:27,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:27,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:27,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316186769] [2019-11-16 00:17:27,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:27,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:27,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:27,992 INFO L87 Difference]: Start difference. First operand 745 states and 1181 transitions. Second operand 3 states. [2019-11-16 00:17:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:28,069 INFO L93 Difference]: Finished difference Result 1117 states and 1772 transitions. [2019-11-16 00:17:28,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:28,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-16 00:17:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:28,076 INFO L225 Difference]: With dead ends: 1117 [2019-11-16 00:17:28,076 INFO L226 Difference]: Without dead ends: 1115 [2019-11-16 00:17:28,076 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-11-16 00:17:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-11-16 00:17:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2019-11-16 00:17:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-16 00:17:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1769 transitions. [2019-11-16 00:17:28,118 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1769 transitions. Word has length 120 [2019-11-16 00:17:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:28,118 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1769 transitions. [2019-11-16 00:17:28,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1769 transitions. [2019-11-16 00:17:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:17:28,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:28,122 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-11-16 00:17:28,122 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash -888705079, now seen corresponding path program 1 times [2019-11-16 00:17:28,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:28,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703948675] [2019-11-16 00:17:28,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:17:28,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703948675] [2019-11-16 00:17:28,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:28,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:28,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358452230] [2019-11-16 00:17:28,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:28,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:28,171 INFO L87 Difference]: Start difference. First operand 1115 states and 1769 transitions. Second operand 3 states. [2019-11-16 00:17:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:28,362 INFO L93 Difference]: Finished difference Result 2349 states and 3730 transitions. [2019-11-16 00:17:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:28,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-16 00:17:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:28,370 INFO L225 Difference]: With dead ends: 2349 [2019-11-16 00:17:28,370 INFO L226 Difference]: Without dead ends: 1241 [2019-11-16 00:17:28,372 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-11-16 00:17:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-16 00:17:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1229. [2019-11-16 00:17:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-11-16 00:17:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1946 transitions. [2019-11-16 00:17:28,418 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1946 transitions. Word has length 121 [2019-11-16 00:17:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:28,418 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 1946 transitions. [2019-11-16 00:17:28,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1946 transitions. [2019-11-16 00:17:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-16 00:17:28,421 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:28,422 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-11-16 00:17:28,422 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash 601692112, now seen corresponding path program 1 times [2019-11-16 00:17:28,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:28,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62261122] [2019-11-16 00:17:28,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:17:28,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62261122] [2019-11-16 00:17:28,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:28,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:28,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29046328] [2019-11-16 00:17:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:28,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:28,455 INFO L87 Difference]: Start difference. First operand 1229 states and 1946 transitions. Second operand 3 states. [2019-11-16 00:17:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:28,642 INFO L93 Difference]: Finished difference Result 2463 states and 3898 transitions. [2019-11-16 00:17:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:28,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-16 00:17:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:28,650 INFO L225 Difference]: With dead ends: 2463 [2019-11-16 00:17:28,650 INFO L226 Difference]: Without dead ends: 1235 [2019-11-16 00:17:28,652 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-11-16 00:17:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-16 00:17:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-16 00:17:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-16 00:17:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1928 transitions. [2019-11-16 00:17:28,697 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1928 transitions. Word has length 122 [2019-11-16 00:17:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:28,698 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1928 transitions. [2019-11-16 00:17:28,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1928 transitions. [2019-11-16 00:17:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-16 00:17:28,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:28,702 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-11-16 00:17:28,702 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1105504061, now seen corresponding path program 1 times [2019-11-16 00:17:28,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:28,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483560738] [2019-11-16 00:17:28,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:28,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-16 00:17:28,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483560738] [2019-11-16 00:17:28,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:28,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:28,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259170347] [2019-11-16 00:17:28,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:28,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:28,749 INFO L87 Difference]: Start difference. First operand 1223 states and 1928 transitions. Second operand 3 states. [2019-11-16 00:17:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:28,955 INFO L93 Difference]: Finished difference Result 2553 states and 4025 transitions. [2019-11-16 00:17:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:28,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-16 00:17:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:28,963 INFO L225 Difference]: With dead ends: 2553 [2019-11-16 00:17:28,963 INFO L226 Difference]: Without dead ends: 1337 [2019-11-16 00:17:28,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-16 00:17:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-11-16 00:17:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-11-16 00:17:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2090 transitions. [2019-11-16 00:17:29,015 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2090 transitions. Word has length 154 [2019-11-16 00:17:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:29,015 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 2090 transitions. [2019-11-16 00:17:29,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2090 transitions. [2019-11-16 00:17:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:17:29,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:29,019 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-11-16 00:17:29,019 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2116162422, now seen corresponding path program 1 times [2019-11-16 00:17:29,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:29,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977515937] [2019-11-16 00:17:29,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-16 00:17:29,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977515937] [2019-11-16 00:17:29,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:29,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:29,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010051480] [2019-11-16 00:17:29,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:29,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:29,088 INFO L87 Difference]: Start difference. First operand 1331 states and 2090 transitions. Second operand 3 states. [2019-11-16 00:17:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,284 INFO L93 Difference]: Finished difference Result 2661 states and 4175 transitions. [2019-11-16 00:17:29,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:29,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-16 00:17:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,293 INFO L225 Difference]: With dead ends: 2661 [2019-11-16 00:17:29,293 INFO L226 Difference]: Without dead ends: 1331 [2019-11-16 00:17:29,295 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-11-16 00:17:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-11-16 00:17:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1325. [2019-11-16 00:17:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-11-16 00:17:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2069 transitions. [2019-11-16 00:17:29,343 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2069 transitions. Word has length 155 [2019-11-16 00:17:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:29,343 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 2069 transitions. [2019-11-16 00:17:29,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2069 transitions. [2019-11-16 00:17:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:17:29,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:29,348 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-11-16 00:17:29,348 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash 926552750, now seen corresponding path program 1 times [2019-11-16 00:17:29,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:29,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277567501] [2019-11-16 00:17:29,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-16 00:17:29,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277567501] [2019-11-16 00:17:29,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:29,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:29,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891115534] [2019-11-16 00:17:29,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:29,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:29,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:29,423 INFO L87 Difference]: Start difference. First operand 1325 states and 2069 transitions. Second operand 3 states. [2019-11-16 00:17:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,601 INFO L93 Difference]: Finished difference Result 2751 states and 4295 transitions. [2019-11-16 00:17:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:29,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-16 00:17:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,609 INFO L225 Difference]: With dead ends: 2751 [2019-11-16 00:17:29,610 INFO L226 Difference]: Without dead ends: 1433 [2019-11-16 00:17:29,611 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-11-16 00:17:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-11-16 00:17:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1427. [2019-11-16 00:17:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-11-16 00:17:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2216 transitions. [2019-11-16 00:17:29,661 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2216 transitions. Word has length 185 [2019-11-16 00:17:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:29,662 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 2216 transitions. [2019-11-16 00:17:29,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2216 transitions. [2019-11-16 00:17:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-16 00:17:29,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:29,666 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-11-16 00:17:29,666 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash 405410805, now seen corresponding path program 1 times [2019-11-16 00:17:29,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:29,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420467265] [2019-11-16 00:17:29,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-16 00:17:29,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420467265] [2019-11-16 00:17:29,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:29,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:29,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305599804] [2019-11-16 00:17:29,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:29,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:29,719 INFO L87 Difference]: Start difference. First operand 1427 states and 2216 transitions. Second operand 3 states. [2019-11-16 00:17:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:29,913 INFO L93 Difference]: Finished difference Result 2853 states and 4427 transitions. [2019-11-16 00:17:29,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:29,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-16 00:17:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:29,921 INFO L225 Difference]: With dead ends: 2853 [2019-11-16 00:17:29,921 INFO L226 Difference]: Without dead ends: 1427 [2019-11-16 00:17:29,924 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-11-16 00:17:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-16 00:17:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1421. [2019-11-16 00:17:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-11-16 00:17:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2192 transitions. [2019-11-16 00:17:29,972 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2192 transitions. Word has length 186 [2019-11-16 00:17:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:29,972 INFO L462 AbstractCegarLoop]: Abstraction has 1421 states and 2192 transitions. [2019-11-16 00:17:29,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2192 transitions. [2019-11-16 00:17:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-16 00:17:29,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:29,977 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-11-16 00:17:29,977 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash 311594383, now seen corresponding path program 1 times [2019-11-16 00:17:29,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:29,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308872053] [2019-11-16 00:17:29,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:29,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-16 00:17:30,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308872053] [2019-11-16 00:17:30,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:30,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677173664] [2019-11-16 00:17:30,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:30,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:30,054 INFO L87 Difference]: Start difference. First operand 1421 states and 2192 transitions. Second operand 3 states. [2019-11-16 00:17:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,269 INFO L93 Difference]: Finished difference Result 2946 states and 4556 transitions. [2019-11-16 00:17:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:30,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-16 00:17:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,279 INFO L225 Difference]: With dead ends: 2946 [2019-11-16 00:17:30,279 INFO L226 Difference]: Without dead ends: 1532 [2019-11-16 00:17:30,281 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-11-16 00:17:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-16 00:17:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-16 00:17:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-16 00:17:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2288 transitions. [2019-11-16 00:17:30,346 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2288 transitions. Word has length 203 [2019-11-16 00:17:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,346 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2288 transitions. [2019-11-16 00:17:30,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2288 transitions. [2019-11-16 00:17:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-16 00:17:30,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,351 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-11-16 00:17:30,351 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1374927291, now seen corresponding path program 1 times [2019-11-16 00:17:30,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024665963] [2019-11-16 00:17:30,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-16 00:17:30,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024665963] [2019-11-16 00:17:30,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:30,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025241217] [2019-11-16 00:17:30,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:30,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:30,407 INFO L87 Difference]: Start difference. First operand 1496 states and 2288 transitions. Second operand 3 states. [2019-11-16 00:17:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,566 INFO L93 Difference]: Finished difference Result 3021 states and 4625 transitions. [2019-11-16 00:17:30,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:30,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-16 00:17:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,575 INFO L225 Difference]: With dead ends: 3021 [2019-11-16 00:17:30,575 INFO L226 Difference]: Without dead ends: 1532 [2019-11-16 00:17:30,579 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-11-16 00:17:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-16 00:17:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-16 00:17:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-16 00:17:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2261 transitions. [2019-11-16 00:17:30,624 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2261 transitions. Word has length 204 [2019-11-16 00:17:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,624 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2261 transitions. [2019-11-16 00:17:30,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2261 transitions. [2019-11-16 00:17:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-16 00:17:30,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,629 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-11-16 00:17:30,629 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1705472573, now seen corresponding path program 1 times [2019-11-16 00:17:30,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374541493] [2019-11-16 00:17:30,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-16 00:17:30,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374541493] [2019-11-16 00:17:30,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:30,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350364842] [2019-11-16 00:17:30,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:30,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:30,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:30,691 INFO L87 Difference]: Start difference. First operand 1496 states and 2261 transitions. Second operand 3 states. [2019-11-16 00:17:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:30,861 INFO L93 Difference]: Finished difference Result 2997 states and 4526 transitions. [2019-11-16 00:17:30,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:30,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-16 00:17:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:30,870 INFO L225 Difference]: With dead ends: 2997 [2019-11-16 00:17:30,870 INFO L226 Difference]: Without dead ends: 1508 [2019-11-16 00:17:30,872 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-11-16 00:17:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-11-16 00:17:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1496. [2019-11-16 00:17:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-16 00:17:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-11-16 00:17:30,916 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 216 [2019-11-16 00:17:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:30,917 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-11-16 00:17:30,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-11-16 00:17:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-16 00:17:30,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:30,922 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-11-16 00:17:30,922 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:30,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:30,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2105710730, now seen corresponding path program 1 times [2019-11-16 00:17:30,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:30,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619672063] [2019-11-16 00:17:30,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:30,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-16 00:17:30,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619672063] [2019-11-16 00:17:30,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:30,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:30,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46715205] [2019-11-16 00:17:30,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:30,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:30,980 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-11-16 00:17:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,142 INFO L93 Difference]: Finished difference Result 2997 states and 4490 transitions. [2019-11-16 00:17:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:31,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-16 00:17:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,151 INFO L225 Difference]: With dead ends: 2997 [2019-11-16 00:17:31,151 INFO L226 Difference]: Without dead ends: 1481 [2019-11-16 00:17:31,153 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-11-16 00:17:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-16 00:17:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1469. [2019-11-16 00:17:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-11-16 00:17:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2186 transitions. [2019-11-16 00:17:31,229 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2186 transitions. Word has length 217 [2019-11-16 00:17:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,229 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 2186 transitions. [2019-11-16 00:17:31,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2186 transitions. [2019-11-16 00:17:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-16 00:17:31,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,234 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] [2019-11-16 00:17:31,234 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash 721369725, now seen corresponding path program 1 times [2019-11-16 00:17:31,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311279101] [2019-11-16 00:17:31,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-16 00:17:31,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311279101] [2019-11-16 00:17:31,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:31,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:31,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131902471] [2019-11-16 00:17:31,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:31,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:31,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:31,294 INFO L87 Difference]: Start difference. First operand 1469 states and 2186 transitions. Second operand 3 states. [2019-11-16 00:17:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,461 INFO L93 Difference]: Finished difference Result 2986 states and 4447 transitions. [2019-11-16 00:17:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:31,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-16 00:17:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,470 INFO L225 Difference]: With dead ends: 2986 [2019-11-16 00:17:31,470 INFO L226 Difference]: Without dead ends: 1524 [2019-11-16 00:17:31,472 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-11-16 00:17:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2019-11-16 00:17:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1515. [2019-11-16 00:17:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-16 00:17:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2230 transitions. [2019-11-16 00:17:31,518 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2230 transitions. Word has length 223 [2019-11-16 00:17:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,518 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2230 transitions. [2019-11-16 00:17:31,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2230 transitions. [2019-11-16 00:17:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:17:31,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,523 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] [2019-11-16 00:17:31,523 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash 194394121, now seen corresponding path program 1 times [2019-11-16 00:17:31,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845232670] [2019-11-16 00:17:31,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-16 00:17:31,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845232670] [2019-11-16 00:17:31,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:31,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:17:31,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741593015] [2019-11-16 00:17:31,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:31,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:31,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:31,583 INFO L87 Difference]: Start difference. First operand 1515 states and 2230 transitions. Second operand 3 states. [2019-11-16 00:17:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:31,732 INFO L93 Difference]: Finished difference Result 2605 states and 3838 transitions. [2019-11-16 00:17:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:31,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-16 00:17:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:31,739 INFO L225 Difference]: With dead ends: 2605 [2019-11-16 00:17:31,739 INFO L226 Difference]: Without dead ends: 1085 [2019-11-16 00:17:31,741 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-11-16 00:17:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-16 00:17:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1079. [2019-11-16 00:17:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-16 00:17:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1573 transitions. [2019-11-16 00:17:31,774 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1573 transitions. Word has length 224 [2019-11-16 00:17:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:31,774 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1573 transitions. [2019-11-16 00:17:31,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1573 transitions. [2019-11-16 00:17:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-16 00:17:31,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:31,779 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] [2019-11-16 00:17:31,780 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1786104814, now seen corresponding path program 1 times [2019-11-16 00:17:31,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:31,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218114879] [2019-11-16 00:17:31,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-16 00:17:31,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218114879] [2019-11-16 00:17:31,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696079567] [2019-11-16 00:17:31,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/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-11-16 00:17:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:17:32,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-16 00:17:32,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:17:32,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:17:32,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35811470] [2019-11-16 00:17:32,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:32,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:17:32,167 INFO L87 Difference]: Start difference. First operand 1079 states and 1573 transitions. Second operand 3 states. [2019-11-16 00:17:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,263 INFO L93 Difference]: Finished difference Result 2658 states and 3873 transitions. [2019-11-16 00:17:32,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:32,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-16 00:17:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,284 INFO L225 Difference]: With dead ends: 2658 [2019-11-16 00:17:32,291 INFO L226 Difference]: Without dead ends: 1586 [2019-11-16 00:17:32,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 260 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-11-16 00:17:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-11-16 00:17:32,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2019-11-16 00:17:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-16 00:17:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2310 transitions. [2019-11-16 00:17:32,394 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2310 transitions. Word has length 260 [2019-11-16 00:17:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,395 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2310 transitions. [2019-11-16 00:17:32,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2310 transitions. [2019-11-16 00:17:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-16 00:17:32,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,400 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, 1, 1] [2019-11-16 00:17:32,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:32,605 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1088106038, now seen corresponding path program 1 times [2019-11-16 00:17:32,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:32,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420041426] [2019-11-16 00:17:32,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:32,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-16 00:17:32,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420041426] [2019-11-16 00:17:32,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:32,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:32,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215097093] [2019-11-16 00:17:32,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:32,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:32,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:32,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:32,749 INFO L87 Difference]: Start difference. First operand 1586 states and 2310 transitions. Second operand 3 states. [2019-11-16 00:17:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:32,858 INFO L93 Difference]: Finished difference Result 4663 states and 6788 transitions. [2019-11-16 00:17:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:32,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-16 00:17:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:32,865 INFO L225 Difference]: With dead ends: 4663 [2019-11-16 00:17:32,866 INFO L226 Difference]: Without dead ends: 3084 [2019-11-16 00:17:32,869 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-11-16 00:17:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2019-11-16 00:17:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3082. [2019-11-16 00:17:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-11-16 00:17:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4479 transitions. [2019-11-16 00:17:32,990 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4479 transitions. Word has length 270 [2019-11-16 00:17:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:32,990 INFO L462 AbstractCegarLoop]: Abstraction has 3082 states and 4479 transitions. [2019-11-16 00:17:32,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4479 transitions. [2019-11-16 00:17:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-16 00:17:32,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:32,998 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, 1, 1] [2019-11-16 00:17:32,999 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 420200473, now seen corresponding path program 1 times [2019-11-16 00:17:33,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:33,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721595282] [2019-11-16 00:17:33,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:33,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-16 00:17:33,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721595282] [2019-11-16 00:17:33,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:33,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:33,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032576766] [2019-11-16 00:17:33,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:33,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:33,110 INFO L87 Difference]: Start difference. First operand 3082 states and 4479 transitions. Second operand 3 states. [2019-11-16 00:17:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:33,338 INFO L93 Difference]: Finished difference Result 6317 states and 9203 transitions. [2019-11-16 00:17:33,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:33,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-16 00:17:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:33,342 INFO L225 Difference]: With dead ends: 6317 [2019-11-16 00:17:33,343 INFO L226 Difference]: Without dead ends: 2034 [2019-11-16 00:17:33,350 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-11-16 00:17:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-11-16 00:17:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2014. [2019-11-16 00:17:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-11-16 00:17:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2877 transitions. [2019-11-16 00:17:33,424 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2877 transitions. Word has length 307 [2019-11-16 00:17:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:33,425 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2877 transitions. [2019-11-16 00:17:33,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2877 transitions. [2019-11-16 00:17:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-11-16 00:17:33,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:33,433 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:33,433 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash 982370538, now seen corresponding path program 1 times [2019-11-16 00:17:33,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:33,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855582926] [2019-11-16 00:17:33,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:33,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:33,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-16 00:17:33,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855582926] [2019-11-16 00:17:33,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416975551] [2019-11-16 00:17:33,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/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-11-16 00:17:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:33,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:17:33,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-16 00:17:33,885 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:33,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:17:33,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237034368] [2019-11-16 00:17:33,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:33,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:33,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:33,888 INFO L87 Difference]: Start difference. First operand 2014 states and 2877 transitions. Second operand 4 states. [2019-11-16 00:17:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:34,218 INFO L93 Difference]: Finished difference Result 4694 states and 6697 transitions. [2019-11-16 00:17:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:17:34,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-11-16 00:17:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:34,223 INFO L225 Difference]: With dead ends: 4694 [2019-11-16 00:17:34,223 INFO L226 Difference]: Without dead ends: 2643 [2019-11-16 00:17:34,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 374 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-11-16 00:17:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-11-16 00:17:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1989. [2019-11-16 00:17:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-16 00:17:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-16 00:17:34,297 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 372 [2019-11-16 00:17:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:34,297 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-16 00:17:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-16 00:17:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-16 00:17:34,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:34,312 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:34,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:34,518 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1689104854, now seen corresponding path program 1 times [2019-11-16 00:17:34,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:34,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055095438] [2019-11-16 00:17:34,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:34,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-16 00:17:34,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055095438] [2019-11-16 00:17:34,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589255320] [2019-11-16 00:17:34,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/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-11-16 00:17:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:35,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:17:35,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:17:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-16 00:17:35,355 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:17:35,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-16 00:17:35,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537478603] [2019-11-16 00:17:35,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:17:35,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:17:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:17:35,357 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 4 states. [2019-11-16 00:17:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:35,670 INFO L93 Difference]: Finished difference Result 4937 states and 6862 transitions. [2019-11-16 00:17:35,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:17:35,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-11-16 00:17:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:35,676 INFO L225 Difference]: With dead ends: 4937 [2019-11-16 00:17:35,677 INFO L226 Difference]: Without dead ends: 2814 [2019-11-16 00:17:35,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 602 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-11-16 00:17:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2019-11-16 00:17:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1989. [2019-11-16 00:17:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-16 00:17:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-16 00:17:35,753 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 600 [2019-11-16 00:17:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:35,753 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-16 00:17:35,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:17:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-16 00:17:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-11-16 00:17:35,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:35,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:35,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:17:35,973 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1687662778, now seen corresponding path program 1 times [2019-11-16 00:17:35,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:35,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539960855] [2019-11-16 00:17:35,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:35,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-16 00:17:36,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539960855] [2019-11-16 00:17:36,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:36,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:36,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423061308] [2019-11-16 00:17:36,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:36,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:36,353 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 3 states. [2019-11-16 00:17:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:36,575 INFO L93 Difference]: Finished difference Result 4007 states and 5539 transitions. [2019-11-16 00:17:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:36,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-11-16 00:17:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:36,580 INFO L225 Difference]: With dead ends: 4007 [2019-11-16 00:17:36,580 INFO L226 Difference]: Without dead ends: 2025 [2019-11-16 00:17:36,583 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-11-16 00:17:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-11-16 00:17:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1989. [2019-11-16 00:17:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-16 00:17:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2733 transitions. [2019-11-16 00:17:36,669 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2733 transitions. Word has length 667 [2019-11-16 00:17:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:36,670 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2733 transitions. [2019-11-16 00:17:36,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2733 transitions. [2019-11-16 00:17:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-11-16 00:17:36,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:36,719 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, 1, 1, 1, 1, 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-11-16 00:17:36,720 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1182124796, now seen corresponding path program 1 times [2019-11-16 00:17:36,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:36,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549248987] [2019-11-16 00:17:36,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:36,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:36,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-16 00:17:37,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549248987] [2019-11-16 00:17:37,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:37,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:37,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434503009] [2019-11-16 00:17:37,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:37,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:37,076 INFO L87 Difference]: Start difference. First operand 1989 states and 2733 transitions. Second operand 3 states. [2019-11-16 00:17:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:37,284 INFO L93 Difference]: Finished difference Result 3986 states and 5473 transitions. [2019-11-16 00:17:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:37,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 681 [2019-11-16 00:17:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:37,288 INFO L225 Difference]: With dead ends: 3986 [2019-11-16 00:17:37,289 INFO L226 Difference]: Without dead ends: 2004 [2019-11-16 00:17:37,291 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-11-16 00:17:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-11-16 00:17:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1976. [2019-11-16 00:17:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-11-16 00:17:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2674 transitions. [2019-11-16 00:17:37,357 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2674 transitions. Word has length 681 [2019-11-16 00:17:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:37,358 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 2674 transitions. [2019-11-16 00:17:37,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2674 transitions. [2019-11-16 00:17:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-11-16 00:17:37,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:37,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:17:37,375 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:37,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 8635284, now seen corresponding path program 1 times [2019-11-16 00:17:37,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:37,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554854035] [2019-11-16 00:17:37,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:37,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:37,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-16 00:17:37,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554854035] [2019-11-16 00:17:37,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:37,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:37,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282007976] [2019-11-16 00:17:37,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:37,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:37,776 INFO L87 Difference]: Start difference. First operand 1976 states and 2674 transitions. Second operand 3 states. [2019-11-16 00:17:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:37,965 INFO L93 Difference]: Finished difference Result 4014 states and 5435 transitions. [2019-11-16 00:17:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:37,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 710 [2019-11-16 00:17:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:37,970 INFO L225 Difference]: With dead ends: 4014 [2019-11-16 00:17:37,970 INFO L226 Difference]: Without dead ends: 2027 [2019-11-16 00:17:37,973 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-11-16 00:17:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-16 00:17:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2018. [2019-11-16 00:17:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-11-16 00:17:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2719 transitions. [2019-11-16 00:17:38,040 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2719 transitions. Word has length 710 [2019-11-16 00:17:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:38,041 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 2719 transitions. [2019-11-16 00:17:38,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2719 transitions. [2019-11-16 00:17:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2019-11-16 00:17:38,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:17:38,060 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, 1, 1, 1, 1, 1, 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-11-16 00:17:38,061 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:17:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:17:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1819983258, now seen corresponding path program 1 times [2019-11-16 00:17:38,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:17:38,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734619644] [2019-11-16 00:17:38,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:38,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:17:38,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:17:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:17:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-16 00:17:38,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734619644] [2019-11-16 00:17:38,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:17:38,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:17:38,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149944660] [2019-11-16 00:17:38,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:17:38,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:17:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:17:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:17:38,590 INFO L87 Difference]: Start difference. First operand 2018 states and 2719 transitions. Second operand 3 states. [2019-11-16 00:17:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:17:38,724 INFO L93 Difference]: Finished difference Result 2591 states and 3474 transitions. [2019-11-16 00:17:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:17:38,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 725 [2019-11-16 00:17:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:17:38,726 INFO L225 Difference]: With dead ends: 2591 [2019-11-16 00:17:38,726 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:17:38,728 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-11-16 00:17:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:17:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:17:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:17:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:17:38,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 725 [2019-11-16 00:17:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:17:38,730 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:17:38,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:17:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:17:38,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:17:38,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:17:39,505 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-16 00:17:39,890 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-16 00:17:40,298 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-16 00:17:40,743 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-16 00:17:41,164 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-16 00:17:41,598 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-16 00:17:41,942 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-16 00:17:42,289 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-16 00:17:42,629 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-16 00:17:42,887 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-16 00:17:43,234 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-16 00:17:43,586 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-16 00:17:43,921 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-16 00:17:44,233 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-16 00:17:44,583 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-16 00:17:44,899 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-16 00:17:45,426 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-16 00:17:45,698 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-16 00:17:45,999 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-16 00:17:46,233 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-16 00:17:46,540 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-16 00:17:47,073 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-16 00:17:47,075 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-16 00:17:47,075 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-16 00:17:47,075 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-16 00:17:47,075 INFO L443 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-16 00:17:47,075 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-16 00:17:47,076 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 596) 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-11-16 00:17:47,077 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 628) 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-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L443 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:17:47,077 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-16 00:17:47,078 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 606) 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-11-16 00:17:47,078 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 617) 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-11-16 00:17:47,078 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-16 00:17:47,078 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-16 00:17:47,078 INFO L439 ceAbstractionStarter]: At program point L404(lines 395 415) 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 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .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-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-16 00:17:47,079 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-16 00:17:47,080 INFO L443 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-16 00:17:47,080 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 604) 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-11-16 00:17:47,080 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 615) 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-11-16 00:17:47,080 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-16 00:17:47,080 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 627) 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-11-16 00:17:47,081 INFO L446 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L446 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-16 00:17:47,081 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-16 00:17:47,082 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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-11-16 00:17:47,083 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 613) 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-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-16 00:17:47,083 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 623) 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))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (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 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (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)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (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 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-16 00:17:47,084 INFO L443 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L443 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L439 ceAbstractionStarter]: At program point L553(lines 65 677) the Hoare annotation is: false [2019-11-16 00:17:47,085 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:17:47,085 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 600) 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-11-16 00:17:47,087 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 611) 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 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .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-11-16 00:17:47,088 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 621) 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-11-16 00:17:47,088 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-16 00:17:47,088 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-16 00:17:47,088 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-16 00:17:47,088 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-16 00:17:47,089 INFO L446 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-16 00:17:47,089 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-16 00:17:47,089 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:17:47,089 INFO L439 ceAbstractionStarter]: At program point L591(lines 99 659) 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-11-16 00:17:47,089 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-16 00:17:47,090 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-16 00:17:47,090 INFO L439 ceAbstractionStarter]: At program point L360(lines 342 378) 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-11-16 00:17:47,090 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-16 00:17:47,090 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-16 00:17:47,090 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-16 00:17:47,091 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 671) no Hoare annotation was computed. [2019-11-16 00:17:47,091 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-16 00:17:47,091 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-16 00:17:47,091 INFO L443 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-16 00:17:47,091 INFO L439 ceAbstractionStarter]: At program point L394(lines 385 416) 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 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .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-11-16 00:17:47,091 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-16 00:17:47,092 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 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-11-16 00:17:47,092 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 609) 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 8545))) (.cse4 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (<= 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)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-16 00:17:47,092 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-16 00:17:47,093 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-16 00:17:47,093 INFO L446 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-16 00:17:47,093 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-16 00:17:47,093 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-16 00:17:47,093 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-16 00:17:47,093 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-16 00:17:47,093 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-16 00:17:47,094 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 659) 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-11-16 00:17:47,094 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 607) 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-11-16 00:17:47,094 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 620) 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-11-16 00:17:47,095 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:17:47,095 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-16 00:17:47,095 INFO L443 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-16 00:17:47,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:17:47 BoogieIcfgContainer [2019-11-16 00:17:47,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:17:47,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:17:47,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:17:47,138 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:17:47,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:23" (3/4) ... [2019-11-16 00:17:47,142 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:17:47,157 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:17:47,158 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:17:47,257 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_933711eb-b0c9-4ccd-a583-b489519a49dd/bin/uautomizer/witness.graphml [2019-11-16 00:17:47,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:17:47,259 INFO L168 Benchmark]: Toolchain (without parser) took 24652.28 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -417.2 MB). Peak memory consumption was 841.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:47,260 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:47,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:47,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:17:47,261 INFO L168 Benchmark]: Boogie Preprocessor took 56.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:47,261 INFO L168 Benchmark]: RCFGBuilder took 708.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:47,261 INFO L168 Benchmark]: TraceAbstraction took 23214.46 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -306.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:17:47,262 INFO L168 Benchmark]: Witness Printer took 120.35 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:17:47,263 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 708.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23214.46 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -306.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 120.35 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 671]: 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: 10]: Loop Invariant Derived loop invariant: 1 - 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: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - 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: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(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 == 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: 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: 385]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(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 == 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: 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: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(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 == 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: 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: 342]: 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: 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: 65]: Loop Invariant Derived loop invariant: 1 - 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: 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: 65]: Loop Invariant Derived loop invariant: 0 - 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: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && 8448 <= s__state) || (((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8640)) && !(0 == s__hit)) - InvariantResult [Line: 117]: 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 == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && !(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 == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) - 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: 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 == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((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, 139 locations, 1 error locations. Result: SAFE, OverallTime: 23.1s, OverallIterations: 37, TraceHistogramMax: 25, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.3s, HoareTripleCheckerStatistics: 5821 SDtfs, 4958 SDslu, 2005 SDs, 0 SdLazy, 3403 SolverSat, 1378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 227 NumberOfFragments, 3561 HoareAnnotationTreeSize, 29 FomulaSimplifications, 33306 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7556 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 9471 NumberOfCodeBlocks, 9471 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9431 ConstructedInterpolants, 0 QuantifiedInterpolants, 4588760 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 40 InterpolantComputations, 35 PerfectInterpolantSequences, 40583/40713 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...