./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/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 41b53a8be36a107d9ce8e745364368cfe44e748b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:35:44,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:35:44,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:35:44,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:35:44,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:35:44,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:35:44,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:35:44,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:35:44,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:35:44,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:35:44,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:35:44,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:35:44,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:35:44,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:35:44,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:35:44,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:35:44,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:35:44,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:35:44,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:35:44,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:35:44,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:35:44,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:35:44,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:35:44,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:35:44,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:35:44,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:35:44,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:35:44,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:35:44,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:35:44,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:35:44,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:35:44,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:35:44,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:35:44,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:35:44,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:35:44,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:35:44,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:35:44,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:35:44,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:35:44,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:35:44,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:35:44,081 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:35:44,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:35:44,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:35:44,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:35:44,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:35:44,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:35:44,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:35:44,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:35:44,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:35:44,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:35:44,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:35:44,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:35:44,095 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_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/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 -> 41b53a8be36a107d9ce8e745364368cfe44e748b [2019-12-07 18:35:44,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:35:44,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:35:44,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:35:44,204 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:35:44,204 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:35:44,205 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-12-07 18:35:44,243 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/data/7bfa2a1dc/fa4a19262ab54e3db1ff79023fbcae05/FLAG0f76dab98 [2019-12-07 18:35:44,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:35:44,691 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-12-07 18:35:44,699 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/data/7bfa2a1dc/fa4a19262ab54e3db1ff79023fbcae05/FLAG0f76dab98 [2019-12-07 18:35:44,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/data/7bfa2a1dc/fa4a19262ab54e3db1ff79023fbcae05 [2019-12-07 18:35:44,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:35:44,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:35:44,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:44,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:35:44,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:35:44,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:44,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17574348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44, skipping insertion in model container [2019-12-07 18:35:44,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:44,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:35:44,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:35:44,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:44,925 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:35:44,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:35:44,972 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:35:44,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44 WrapperNode [2019-12-07 18:35:44,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:35:44,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:35:44,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:35:44,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:35:44,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:44,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:35:45,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:35:45,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:35:45,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:35:45,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... [2019-12-07 18:35:45,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:35:45,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:35:45,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:35:45,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:35:45,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:35:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:35:45,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:35:45,145 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:35:45,455 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 18:35:45,455 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 18:35:45,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:35:45,456 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:35:45,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:45 BoogieIcfgContainer [2019-12-07 18:35:45,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:35:45,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:35:45,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:35:45,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:35:45,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:35:44" (1/3) ... [2019-12-07 18:35:45,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66667ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:35:45, skipping insertion in model container [2019-12-07 18:35:45,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:35:44" (2/3) ... [2019-12-07 18:35:45,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66667ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:35:45, skipping insertion in model container [2019-12-07 18:35:45,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:45" (3/3) ... [2019-12-07 18:35:45,461 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-12-07 18:35:45,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:35:45,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:35:45,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:35:45,495 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:35:45,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:35:45,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:35:45,495 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:35:45,495 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:35:45,495 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:35:45,495 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:35:45,495 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:35:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-12-07 18:35:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:35:45,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:45,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:45,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707020, now seen corresponding path program 1 times [2019-12-07 18:35:45,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:45,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380419590] [2019-12-07 18:35:45,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:45,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380419590] [2019-12-07 18:35:45,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:45,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:45,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933987115] [2019-12-07 18:35:45,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:45,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:45,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:45,698 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-12-07 18:35:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:45,857 INFO L93 Difference]: Finished difference Result 338 states and 585 transitions. [2019-12-07 18:35:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:45,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 18:35:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:45,868 INFO L225 Difference]: With dead ends: 338 [2019-12-07 18:35:45,868 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 18:35:45,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 18:35:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2019-12-07 18:35:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 18:35:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 278 transitions. [2019-12-07 18:35:45,913 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 278 transitions. Word has length 41 [2019-12-07 18:35:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:45,913 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 278 transitions. [2019-12-07 18:35:45,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 278 transitions. [2019-12-07 18:35:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:35:45,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:45,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:45,916 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716333, now seen corresponding path program 1 times [2019-12-07 18:35:45,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:45,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216097013] [2019-12-07 18:35:45,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:45,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216097013] [2019-12-07 18:35:45,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:45,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:45,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890754335] [2019-12-07 18:35:45,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:45,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:45,977 INFO L87 Difference]: Start difference. First operand 171 states and 278 transitions. Second operand 3 states. [2019-12-07 18:35:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,104 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2019-12-07 18:35:46,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 18:35:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,107 INFO L225 Difference]: With dead ends: 382 [2019-12-07 18:35:46,107 INFO L226 Difference]: Without dead ends: 218 [2019-12-07 18:35:46,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-12-07 18:35:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-12-07 18:35:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 18:35:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-12-07 18:35:46,120 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 42 [2019-12-07 18:35:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,120 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-12-07 18:35:46,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-12-07 18:35:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:35:46,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,123 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,123 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1839414983, now seen corresponding path program 1 times [2019-12-07 18:35:46,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580725878] [2019-12-07 18:35:46,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:46,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580725878] [2019-12-07 18:35:46,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323622543] [2019-12-07 18:35:46,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,171 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-12-07 18:35:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,278 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-12-07 18:35:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 18:35:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,280 INFO L225 Difference]: With dead ends: 444 [2019-12-07 18:35:46,281 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 18:35:46,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 18:35:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-07 18:35:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 18:35:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-07 18:35:46,293 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 69 [2019-12-07 18:35:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,293 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-07 18:35:46,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-07 18:35:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:35:46,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,295 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,296 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1554149248, now seen corresponding path program 1 times [2019-12-07 18:35:46,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311681918] [2019-12-07 18:35:46,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:46,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311681918] [2019-12-07 18:35:46,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951538958] [2019-12-07 18:35:46,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,335 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-07 18:35:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,445 INFO L93 Difference]: Finished difference Result 513 states and 872 transitions. [2019-12-07 18:35:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-07 18:35:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,448 INFO L225 Difference]: With dead ends: 513 [2019-12-07 18:35:46,448 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 18:35:46,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 18:35:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-12-07 18:35:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 18:35:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 472 transitions. [2019-12-07 18:35:46,468 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 472 transitions. Word has length 74 [2019-12-07 18:35:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,468 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 472 transitions. [2019-12-07 18:35:46,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 472 transitions. [2019-12-07 18:35:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 18:35:46,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,469 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,469 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1571310151, now seen corresponding path program 1 times [2019-12-07 18:35:46,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288831482] [2019-12-07 18:35:46,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:35:46,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288831482] [2019-12-07 18:35:46,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715793857] [2019-12-07 18:35:46,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,502 INFO L87 Difference]: Start difference. First operand 277 states and 472 transitions. Second operand 3 states. [2019-12-07 18:35:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,593 INFO L93 Difference]: Finished difference Result 549 states and 935 transitions. [2019-12-07 18:35:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-07 18:35:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,595 INFO L225 Difference]: With dead ends: 549 [2019-12-07 18:35:46,595 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 18:35:46,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 18:35:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-12-07 18:35:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 18:35:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 470 transitions. [2019-12-07 18:35:46,602 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 470 transitions. Word has length 75 [2019-12-07 18:35:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,602 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 470 transitions. [2019-12-07 18:35:46,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 470 transitions. [2019-12-07 18:35:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 18:35:46,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,603 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,603 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1779493469, now seen corresponding path program 1 times [2019-12-07 18:35:46,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362686564] [2019-12-07 18:35:46,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:46,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362686564] [2019-12-07 18:35:46,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186337602] [2019-12-07 18:35:46,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,628 INFO L87 Difference]: Start difference. First operand 277 states and 470 transitions. Second operand 3 states. [2019-12-07 18:35:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,698 INFO L93 Difference]: Finished difference Result 564 states and 957 transitions. [2019-12-07 18:35:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 18:35:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,700 INFO L225 Difference]: With dead ends: 564 [2019-12-07 18:35:46,700 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 18:35:46,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 18:35:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-12-07 18:35:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-07 18:35:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-12-07 18:35:46,707 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 81 [2019-12-07 18:35:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,708 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-12-07 18:35:46,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-12-07 18:35:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 18:35:46,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,709 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,709 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash 685947497, now seen corresponding path program 1 times [2019-12-07 18:35:46,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316374471] [2019-12-07 18:35:46,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:46,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316374471] [2019-12-07 18:35:46,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162851572] [2019-12-07 18:35:46,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,733 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 3 states. [2019-12-07 18:35:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,810 INFO L93 Difference]: Finished difference Result 579 states and 975 transitions. [2019-12-07 18:35:46,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 18:35:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,812 INFO L225 Difference]: With dead ends: 579 [2019-12-07 18:35:46,812 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 18:35:46,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 18:35:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-12-07 18:35:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-12-07 18:35:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 488 transitions. [2019-12-07 18:35:46,821 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 488 transitions. Word has length 82 [2019-12-07 18:35:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,821 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 488 transitions. [2019-12-07 18:35:46,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 488 transitions. [2019-12-07 18:35:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 18:35:46,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,823 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash -166367862, now seen corresponding path program 1 times [2019-12-07 18:35:46,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892207836] [2019-12-07 18:35:46,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 18:35:46,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892207836] [2019-12-07 18:35:46,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036854083] [2019-12-07 18:35:46,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,857 INFO L87 Difference]: Start difference. First operand 292 states and 488 transitions. Second operand 3 states. [2019-12-07 18:35:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:46,942 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2019-12-07 18:35:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:46,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-07 18:35:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:46,944 INFO L225 Difference]: With dead ends: 586 [2019-12-07 18:35:46,944 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 18:35:46,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 18:35:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-12-07 18:35:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-07 18:35:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 494 transitions. [2019-12-07 18:35:46,955 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 494 transitions. Word has length 94 [2019-12-07 18:35:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:46,956 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 494 transitions. [2019-12-07 18:35:46,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 494 transitions. [2019-12-07 18:35:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 18:35:46,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:46,957 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:46,957 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1087158848, now seen corresponding path program 1 times [2019-12-07 18:35:46,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:46,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212666612] [2019-12-07 18:35:46,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:46,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212666612] [2019-12-07 18:35:46,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:46,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:46,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180286086] [2019-12-07 18:35:46,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:46,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:46,994 INFO L87 Difference]: Start difference. First operand 301 states and 494 transitions. Second operand 3 states. [2019-12-07 18:35:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,087 INFO L93 Difference]: Finished difference Result 626 states and 1030 transitions. [2019-12-07 18:35:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 18:35:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,089 INFO L225 Difference]: With dead ends: 626 [2019-12-07 18:35:47,089 INFO L226 Difference]: Without dead ends: 332 [2019-12-07 18:35:47,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-07 18:35:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-12-07 18:35:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-07 18:35:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 541 transitions. [2019-12-07 18:35:47,097 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 541 transitions. Word has length 95 [2019-12-07 18:35:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:47,097 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 541 transitions. [2019-12-07 18:35:47,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 541 transitions. [2019-12-07 18:35:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 18:35:47,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:47,098 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:47,099 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:47,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2088595028, now seen corresponding path program 1 times [2019-12-07 18:35:47,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:47,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259209887] [2019-12-07 18:35:47,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:47,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259209887] [2019-12-07 18:35:47,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:47,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:47,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925488922] [2019-12-07 18:35:47,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:47,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,121 INFO L87 Difference]: Start difference. First operand 330 states and 541 transitions. Second operand 3 states. [2019-12-07 18:35:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,225 INFO L93 Difference]: Finished difference Result 655 states and 1073 transitions. [2019-12-07 18:35:47,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 18:35:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,227 INFO L225 Difference]: With dead ends: 655 [2019-12-07 18:35:47,227 INFO L226 Difference]: Without dead ends: 332 [2019-12-07 18:35:47,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-07 18:35:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-12-07 18:35:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-07 18:35:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 537 transitions. [2019-12-07 18:35:47,236 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 537 transitions. Word has length 96 [2019-12-07 18:35:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:47,236 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 537 transitions. [2019-12-07 18:35:47,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 537 transitions. [2019-12-07 18:35:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 18:35:47,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:47,238 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:47,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2096161680, now seen corresponding path program 1 times [2019-12-07 18:35:47,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:47,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597247007] [2019-12-07 18:35:47,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:47,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597247007] [2019-12-07 18:35:47,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:47,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:47,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687963064] [2019-12-07 18:35:47,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:47,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,265 INFO L87 Difference]: Start difference. First operand 330 states and 537 transitions. Second operand 3 states. [2019-12-07 18:35:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,358 INFO L93 Difference]: Finished difference Result 688 states and 1123 transitions. [2019-12-07 18:35:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 18:35:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,361 INFO L225 Difference]: With dead ends: 688 [2019-12-07 18:35:47,361 INFO L226 Difference]: Without dead ends: 365 [2019-12-07 18:35:47,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-07 18:35:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-12-07 18:35:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-07 18:35:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 579 transitions. [2019-12-07 18:35:47,374 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 579 transitions. Word has length 97 [2019-12-07 18:35:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:47,375 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 579 transitions. [2019-12-07 18:35:47,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 579 transitions. [2019-12-07 18:35:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:35:47,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:47,376 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:47,376 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash -297892004, now seen corresponding path program 1 times [2019-12-07 18:35:47,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:47,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923902903] [2019-12-07 18:35:47,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:47,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923902903] [2019-12-07 18:35:47,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:47,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:47,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833191381] [2019-12-07 18:35:47,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:47,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,409 INFO L87 Difference]: Start difference. First operand 357 states and 579 transitions. Second operand 3 states. [2019-12-07 18:35:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,518 INFO L93 Difference]: Finished difference Result 715 states and 1160 transitions. [2019-12-07 18:35:47,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 18:35:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,521 INFO L225 Difference]: With dead ends: 715 [2019-12-07 18:35:47,521 INFO L226 Difference]: Without dead ends: 365 [2019-12-07 18:35:47,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-07 18:35:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-12-07 18:35:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-07 18:35:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2019-12-07 18:35:47,534 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 98 [2019-12-07 18:35:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:47,535 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2019-12-07 18:35:47,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2019-12-07 18:35:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 18:35:47,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:47,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:47,537 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash 386381809, now seen corresponding path program 1 times [2019-12-07 18:35:47,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:47,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125773941] [2019-12-07 18:35:47,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 18:35:47,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125773941] [2019-12-07 18:35:47,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:47,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:47,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902442836] [2019-12-07 18:35:47,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:47,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,571 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand 3 states. [2019-12-07 18:35:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,684 INFO L93 Difference]: Finished difference Result 743 states and 1195 transitions. [2019-12-07 18:35:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 18:35:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,687 INFO L225 Difference]: With dead ends: 743 [2019-12-07 18:35:47,687 INFO L226 Difference]: Without dead ends: 393 [2019-12-07 18:35:47,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-07 18:35:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-12-07 18:35:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 18:35:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 627 transitions. [2019-12-07 18:35:47,701 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 627 transitions. Word has length 105 [2019-12-07 18:35:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:47,701 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 627 transitions. [2019-12-07 18:35:47,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 627 transitions. [2019-12-07 18:35:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 18:35:47,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:47,703 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:47,703 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1882644280, now seen corresponding path program 1 times [2019-12-07 18:35:47,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:47,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356084862] [2019-12-07 18:35:47,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 18:35:47,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356084862] [2019-12-07 18:35:47,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:47,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:47,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089614608] [2019-12-07 18:35:47,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:47,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:47,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,737 INFO L87 Difference]: Start difference. First operand 391 states and 627 transitions. Second operand 3 states. [2019-12-07 18:35:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,838 INFO L93 Difference]: Finished difference Result 777 states and 1245 transitions. [2019-12-07 18:35:47,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 18:35:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,840 INFO L225 Difference]: With dead ends: 777 [2019-12-07 18:35:47,840 INFO L226 Difference]: Without dead ends: 393 [2019-12-07 18:35:47,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-07 18:35:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-12-07 18:35:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 18:35:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 624 transitions. [2019-12-07 18:35:47,850 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 624 transitions. Word has length 106 [2019-12-07 18:35:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:47,850 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 624 transitions. [2019-12-07 18:35:47,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 624 transitions. [2019-12-07 18:35:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 18:35:47,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:47,852 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:47,852 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1260059449, now seen corresponding path program 1 times [2019-12-07 18:35:47,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:47,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073391767] [2019-12-07 18:35:47,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:47,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073391767] [2019-12-07 18:35:47,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:47,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:47,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350020448] [2019-12-07 18:35:47,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:47,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,877 INFO L87 Difference]: Start difference. First operand 391 states and 624 transitions. Second operand 3 states. [2019-12-07 18:35:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:47,986 INFO L93 Difference]: Finished difference Result 822 states and 1311 transitions. [2019-12-07 18:35:47,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:47,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-12-07 18:35:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:47,989 INFO L225 Difference]: With dead ends: 822 [2019-12-07 18:35:47,989 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 18:35:47,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 18:35:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2019-12-07 18:35:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-07 18:35:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2019-12-07 18:35:48,007 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 111 [2019-12-07 18:35:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,007 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2019-12-07 18:35:48,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2019-12-07 18:35:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 18:35:48,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,009 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,010 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1753706176, now seen corresponding path program 1 times [2019-12-07 18:35:48,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602638229] [2019-12-07 18:35:48,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:35:48,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602638229] [2019-12-07 18:35:48,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785868243] [2019-12-07 18:35:48,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,046 INFO L87 Difference]: Start difference. First operand 433 states and 689 transitions. Second operand 3 states. [2019-12-07 18:35:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,156 INFO L93 Difference]: Finished difference Result 868 states and 1382 transitions. [2019-12-07 18:35:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-12-07 18:35:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,158 INFO L225 Difference]: With dead ends: 868 [2019-12-07 18:35:48,158 INFO L226 Difference]: Without dead ends: 440 [2019-12-07 18:35:48,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-07 18:35:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-12-07 18:35:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-07 18:35:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 692 transitions. [2019-12-07 18:35:48,168 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 692 transitions. Word has length 112 [2019-12-07 18:35:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,169 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 692 transitions. [2019-12-07 18:35:48,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 692 transitions. [2019-12-07 18:35:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 18:35:48,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,170 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,170 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 793971013, now seen corresponding path program 1 times [2019-12-07 18:35:48,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216554159] [2019-12-07 18:35:48,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-07 18:35:48,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216554159] [2019-12-07 18:35:48,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125422478] [2019-12-07 18:35:48,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,193 INFO L87 Difference]: Start difference. First operand 435 states and 692 transitions. Second operand 3 states. [2019-12-07 18:35:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,288 INFO L93 Difference]: Finished difference Result 901 states and 1437 transitions. [2019-12-07 18:35:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 18:35:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,290 INFO L225 Difference]: With dead ends: 901 [2019-12-07 18:35:48,290 INFO L226 Difference]: Without dead ends: 473 [2019-12-07 18:35:48,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-07 18:35:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-12-07 18:35:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-07 18:35:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 727 transitions. [2019-12-07 18:35:48,301 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 727 transitions. Word has length 123 [2019-12-07 18:35:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,301 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 727 transitions. [2019-12-07 18:35:48,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 727 transitions. [2019-12-07 18:35:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 18:35:48,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,302 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,302 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2143195791, now seen corresponding path program 1 times [2019-12-07 18:35:48,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591671323] [2019-12-07 18:35:48,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-07 18:35:48,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591671323] [2019-12-07 18:35:48,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350620756] [2019-12-07 18:35:48,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,325 INFO L87 Difference]: Start difference. First operand 460 states and 727 transitions. Second operand 3 states. [2019-12-07 18:35:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,417 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2019-12-07 18:35:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-12-07 18:35:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,419 INFO L225 Difference]: With dead ends: 926 [2019-12-07 18:35:48,419 INFO L226 Difference]: Without dead ends: 473 [2019-12-07 18:35:48,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-07 18:35:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-12-07 18:35:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-07 18:35:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 719 transitions. [2019-12-07 18:35:48,429 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 719 transitions. Word has length 124 [2019-12-07 18:35:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,430 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 719 transitions. [2019-12-07 18:35:48,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 719 transitions. [2019-12-07 18:35:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 18:35:48,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,431 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,431 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash -418940064, now seen corresponding path program 1 times [2019-12-07 18:35:48,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068458724] [2019-12-07 18:35:48,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 18:35:48,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068458724] [2019-12-07 18:35:48,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243055562] [2019-12-07 18:35:48,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,459 INFO L87 Difference]: Start difference. First operand 460 states and 719 transitions. Second operand 3 states. [2019-12-07 18:35:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,560 INFO L93 Difference]: Finished difference Result 917 states and 1432 transitions. [2019-12-07 18:35:48,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-12-07 18:35:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,562 INFO L225 Difference]: With dead ends: 917 [2019-12-07 18:35:48,562 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 18:35:48,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 18:35:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-12-07 18:35:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-07 18:35:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2019-12-07 18:35:48,572 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 136 [2019-12-07 18:35:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,573 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2019-12-07 18:35:48,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2019-12-07 18:35:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 18:35:48,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,574 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,574 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 307186329, now seen corresponding path program 1 times [2019-12-07 18:35:48,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469039860] [2019-12-07 18:35:48,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 18:35:48,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469039860] [2019-12-07 18:35:48,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188917370] [2019-12-07 18:35:48,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,601 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand 3 states. [2019-12-07 18:35:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,699 INFO L93 Difference]: Finished difference Result 917 states and 1422 transitions. [2019-12-07 18:35:48,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-12-07 18:35:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,702 INFO L225 Difference]: With dead ends: 917 [2019-12-07 18:35:48,702 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 18:35:48,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 18:35:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-12-07 18:35:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-07 18:35:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 709 transitions. [2019-12-07 18:35:48,716 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 709 transitions. Word has length 137 [2019-12-07 18:35:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,717 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 709 transitions. [2019-12-07 18:35:48,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 709 transitions. [2019-12-07 18:35:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 18:35:48,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,718 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,718 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,719 INFO L82 PathProgramCache]: Analyzing trace with hash 791534820, now seen corresponding path program 1 times [2019-12-07 18:35:48,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296016423] [2019-12-07 18:35:48,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-12-07 18:35:48,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296016423] [2019-12-07 18:35:48,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82334432] [2019-12-07 18:35:48,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,749 INFO L87 Difference]: Start difference. First operand 460 states and 709 transitions. Second operand 3 states. [2019-12-07 18:35:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,844 INFO L93 Difference]: Finished difference Result 941 states and 1452 transitions. [2019-12-07 18:35:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-12-07 18:35:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,846 INFO L225 Difference]: With dead ends: 941 [2019-12-07 18:35:48,846 INFO L226 Difference]: Without dead ends: 488 [2019-12-07 18:35:48,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-07 18:35:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-12-07 18:35:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 18:35:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 740 transitions. [2019-12-07 18:35:48,857 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 740 transitions. Word has length 144 [2019-12-07 18:35:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,857 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 740 transitions. [2019-12-07 18:35:48,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 740 transitions. [2019-12-07 18:35:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 18:35:48,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,858 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,858 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash -335636264, now seen corresponding path program 1 times [2019-12-07 18:35:48,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661768368] [2019-12-07 18:35:48,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-12-07 18:35:48,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661768368] [2019-12-07 18:35:48,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:48,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:48,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414654173] [2019-12-07 18:35:48,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:48,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,888 INFO L87 Difference]: Start difference. First operand 484 states and 740 transitions. Second operand 3 states. [2019-12-07 18:35:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:48,978 INFO L93 Difference]: Finished difference Result 965 states and 1474 transitions. [2019-12-07 18:35:48,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:48,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-12-07 18:35:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:48,981 INFO L225 Difference]: With dead ends: 965 [2019-12-07 18:35:48,981 INFO L226 Difference]: Without dead ends: 488 [2019-12-07 18:35:48,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-07 18:35:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-12-07 18:35:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 18:35:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 731 transitions. [2019-12-07 18:35:48,996 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 731 transitions. Word has length 145 [2019-12-07 18:35:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:48,997 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 731 transitions. [2019-12-07 18:35:48,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 731 transitions. [2019-12-07 18:35:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 18:35:48,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:48,998 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:48,998 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -122343295, now seen corresponding path program 1 times [2019-12-07 18:35:48,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:48,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397699831] [2019-12-07 18:35:48,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-12-07 18:35:49,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397699831] [2019-12-07 18:35:49,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:49,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:49,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184190971] [2019-12-07 18:35:49,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:49,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,034 INFO L87 Difference]: Start difference. First operand 484 states and 731 transitions. Second operand 3 states. [2019-12-07 18:35:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:49,136 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2019-12-07 18:35:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:49,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-12-07 18:35:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:49,139 INFO L225 Difference]: With dead ends: 1008 [2019-12-07 18:35:49,139 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 18:35:49,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 18:35:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2019-12-07 18:35:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-12-07 18:35:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 786 transitions. [2019-12-07 18:35:49,155 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 786 transitions. Word has length 151 [2019-12-07 18:35:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:49,156 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 786 transitions. [2019-12-07 18:35:49,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 786 transitions. [2019-12-07 18:35:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 18:35:49,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:49,157 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-12-07 18:35:49,157 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1907415640, now seen corresponding path program 1 times [2019-12-07 18:35:49,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:49,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707846415] [2019-12-07 18:35:49,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-12-07 18:35:49,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707846415] [2019-12-07 18:35:49,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:49,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:49,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688348069] [2019-12-07 18:35:49,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:49,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,193 INFO L87 Difference]: Start difference. First operand 525 states and 786 transitions. Second operand 3 states. [2019-12-07 18:35:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:49,299 INFO L93 Difference]: Finished difference Result 1049 states and 1570 transitions. [2019-12-07 18:35:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:49,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-12-07 18:35:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:49,301 INFO L225 Difference]: With dead ends: 1049 [2019-12-07 18:35:49,301 INFO L226 Difference]: Without dead ends: 512 [2019-12-07 18:35:49,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-07 18:35:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2019-12-07 18:35:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-07 18:35:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2019-12-07 18:35:49,313 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 152 [2019-12-07 18:35:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:49,313 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2019-12-07 18:35:49,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2019-12-07 18:35:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 18:35:49,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:49,314 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:49,314 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:49,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1249588557, now seen corresponding path program 1 times [2019-12-07 18:35:49,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:49,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334170683] [2019-12-07 18:35:49,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-12-07 18:35:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334170683] [2019-12-07 18:35:49,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:49,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:49,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588009621] [2019-12-07 18:35:49,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:49,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,343 INFO L87 Difference]: Start difference. First operand 506 states and 756 transitions. Second operand 3 states. [2019-12-07 18:35:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:49,430 INFO L93 Difference]: Finished difference Result 1030 states and 1542 transitions. [2019-12-07 18:35:49,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:49,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 18:35:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:49,432 INFO L225 Difference]: With dead ends: 1030 [2019-12-07 18:35:49,433 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 18:35:49,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 18:35:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2019-12-07 18:35:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-07 18:35:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 780 transitions. [2019-12-07 18:35:49,445 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 780 transitions. Word has length 165 [2019-12-07 18:35:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:49,445 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 780 transitions. [2019-12-07 18:35:49,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 780 transitions. [2019-12-07 18:35:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 18:35:49,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:49,446 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:49,446 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1409544545, now seen corresponding path program 1 times [2019-12-07 18:35:49,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:49,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620516007] [2019-12-07 18:35:49,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-12-07 18:35:49,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620516007] [2019-12-07 18:35:49,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:49,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:35:49,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954671239] [2019-12-07 18:35:49,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:49,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,490 INFO L87 Difference]: Start difference. First operand 527 states and 780 transitions. Second operand 3 states. [2019-12-07 18:35:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:49,592 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2019-12-07 18:35:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:49,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 18:35:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:49,595 INFO L225 Difference]: With dead ends: 1051 [2019-12-07 18:35:49,595 INFO L226 Difference]: Without dead ends: 529 [2019-12-07 18:35:49,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-07 18:35:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2019-12-07 18:35:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-12-07 18:35:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2019-12-07 18:35:49,615 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 166 [2019-12-07 18:35:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:49,615 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2019-12-07 18:35:49,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2019-12-07 18:35:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 18:35:49,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:49,616 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:49,616 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:49,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1453747987, now seen corresponding path program 1 times [2019-12-07 18:35:49,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:49,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42716981] [2019-12-07 18:35:49,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 18:35:49,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42716981] [2019-12-07 18:35:49,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809228320] [2019-12-07 18:35:49,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:49,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:35:49,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-12-07 18:35:49,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:49,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:35:49,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970496511] [2019-12-07 18:35:49,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:49,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:49,798 INFO L87 Difference]: Start difference. First operand 525 states and 766 transitions. Second operand 3 states. [2019-12-07 18:35:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:49,869 INFO L93 Difference]: Finished difference Result 1559 states and 2275 transitions. [2019-12-07 18:35:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:49,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-12-07 18:35:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:49,874 INFO L225 Difference]: With dead ends: 1559 [2019-12-07 18:35:49,874 INFO L226 Difference]: Without dead ends: 1041 [2019-12-07 18:35:49,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-12-07 18:35:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2019-12-07 18:35:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-12-07 18:35:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1512 transitions. [2019-12-07 18:35:49,902 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1512 transitions. Word has length 181 [2019-12-07 18:35:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:49,903 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 1512 transitions. [2019-12-07 18:35:49,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1512 transitions. [2019-12-07 18:35:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 18:35:49,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:49,904 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:50,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:50,105 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676108, now seen corresponding path program 1 times [2019-12-07 18:35:50,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:50,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581085515] [2019-12-07 18:35:50,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 18:35:50,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581085515] [2019-12-07 18:35:50,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:50,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:50,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260606726] [2019-12-07 18:35:50,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:50,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,156 INFO L87 Difference]: Start difference. First operand 1041 states and 1512 transitions. Second operand 3 states. [2019-12-07 18:35:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:50,227 INFO L93 Difference]: Finished difference Result 2585 states and 3758 transitions. [2019-12-07 18:35:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:50,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-12-07 18:35:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:50,234 INFO L225 Difference]: With dead ends: 2585 [2019-12-07 18:35:50,234 INFO L226 Difference]: Without dead ends: 1551 [2019-12-07 18:35:50,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2019-12-07 18:35:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2019-12-07 18:35:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-12-07 18:35:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2248 transitions. [2019-12-07 18:35:50,272 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2248 transitions. Word has length 188 [2019-12-07 18:35:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:50,272 INFO L462 AbstractCegarLoop]: Abstraction has 1551 states and 2248 transitions. [2019-12-07 18:35:50,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2248 transitions. [2019-12-07 18:35:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 18:35:50,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:50,275 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:50,275 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -373781024, now seen corresponding path program 1 times [2019-12-07 18:35:50,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:50,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639257852] [2019-12-07 18:35:50,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 18:35:50,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639257852] [2019-12-07 18:35:50,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:50,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:50,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347385219] [2019-12-07 18:35:50,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:50,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:50,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,312 INFO L87 Difference]: Start difference. First operand 1551 states and 2248 transitions. Second operand 3 states. [2019-12-07 18:35:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:50,401 INFO L93 Difference]: Finished difference Result 3606 states and 5231 transitions. [2019-12-07 18:35:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-12-07 18:35:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:50,413 INFO L225 Difference]: With dead ends: 3606 [2019-12-07 18:35:50,413 INFO L226 Difference]: Without dead ends: 2062 [2019-12-07 18:35:50,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-12-07 18:35:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2019-12-07 18:35:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2019-12-07 18:35:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2985 transitions. [2019-12-07 18:35:50,475 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2985 transitions. Word has length 189 [2019-12-07 18:35:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:50,475 INFO L462 AbstractCegarLoop]: Abstraction has 2062 states and 2985 transitions. [2019-12-07 18:35:50,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2985 transitions. [2019-12-07 18:35:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-12-07 18:35:50,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:50,479 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:50,479 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1948421128, now seen corresponding path program 1 times [2019-12-07 18:35:50,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:50,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284456436] [2019-12-07 18:35:50,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-12-07 18:35:50,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284456436] [2019-12-07 18:35:50,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:50,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:50,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690389406] [2019-12-07 18:35:50,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:50,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,583 INFO L87 Difference]: Start difference. First operand 2062 states and 2985 transitions. Second operand 3 states. [2019-12-07 18:35:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:50,677 INFO L93 Difference]: Finished difference Result 5692 states and 8229 transitions. [2019-12-07 18:35:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:50,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-12-07 18:35:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:50,691 INFO L225 Difference]: With dead ends: 5692 [2019-12-07 18:35:50,691 INFO L226 Difference]: Without dead ends: 3637 [2019-12-07 18:35:50,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2019-12-07 18:35:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2019-12-07 18:35:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-12-07 18:35:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5245 transitions. [2019-12-07 18:35:50,786 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5245 transitions. Word has length 338 [2019-12-07 18:35:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:50,786 INFO L462 AbstractCegarLoop]: Abstraction has 3635 states and 5245 transitions. [2019-12-07 18:35:50,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5245 transitions. [2019-12-07 18:35:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-12-07 18:35:50,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:50,792 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:50,792 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1969862083, now seen corresponding path program 1 times [2019-12-07 18:35:50,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:50,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813151713] [2019-12-07 18:35:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-12-07 18:35:50,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813151713] [2019-12-07 18:35:50,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:50,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:50,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520705542] [2019-12-07 18:35:50,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:50,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:50,902 INFO L87 Difference]: Start difference. First operand 3635 states and 5245 transitions. Second operand 3 states. [2019-12-07 18:35:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:51,072 INFO L93 Difference]: Finished difference Result 7423 states and 10735 transitions. [2019-12-07 18:35:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:51,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-12-07 18:35:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:51,082 INFO L225 Difference]: With dead ends: 7423 [2019-12-07 18:35:51,082 INFO L226 Difference]: Without dead ends: 2498 [2019-12-07 18:35:51,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-12-07 18:35:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498. [2019-12-07 18:35:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-12-07 18:35:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3552 transitions. [2019-12-07 18:35:51,141 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3552 transitions. Word has length 375 [2019-12-07 18:35:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:51,141 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3552 transitions. [2019-12-07 18:35:51,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3552 transitions. [2019-12-07 18:35:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-12-07 18:35:51,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:51,146 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:51,146 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash 943000906, now seen corresponding path program 1 times [2019-12-07 18:35:51,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:51,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254891960] [2019-12-07 18:35:51,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-12-07 18:35:51,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254891960] [2019-12-07 18:35:51,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126793666] [2019-12-07 18:35:51,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:51,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:51,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-12-07 18:35:51,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:51,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:35:51,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610536959] [2019-12-07 18:35:51,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:51,528 INFO L87 Difference]: Start difference. First operand 2498 states and 3552 transitions. Second operand 3 states. [2019-12-07 18:35:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:51,567 INFO L93 Difference]: Finished difference Result 2558 states and 3638 transitions. [2019-12-07 18:35:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:51,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-12-07 18:35:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:51,579 INFO L225 Difference]: With dead ends: 2558 [2019-12-07 18:35:51,579 INFO L226 Difference]: Without dead ends: 2069 [2019-12-07 18:35:51,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-12-07 18:35:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2011. [2019-12-07 18:35:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-12-07 18:35:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2860 transitions. [2019-12-07 18:35:51,622 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2860 transitions. Word has length 441 [2019-12-07 18:35:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:51,622 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 2860 transitions. [2019-12-07 18:35:51,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2860 transitions. [2019-12-07 18:35:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-12-07 18:35:51,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:51,626 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:51,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:51,827 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1896941064, now seen corresponding path program 1 times [2019-12-07 18:35:51,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:51,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006105359] [2019-12-07 18:35:51,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-12-07 18:35:51,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006105359] [2019-12-07 18:35:51,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859572425] [2019-12-07 18:35:51,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:52,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:52,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-12-07 18:35:52,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:52,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:35:52,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483826457] [2019-12-07 18:35:52,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:52,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:52,160 INFO L87 Difference]: Start difference. First operand 2011 states and 2860 transitions. Second operand 3 states. [2019-12-07 18:35:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:52,242 INFO L93 Difference]: Finished difference Result 4484 states and 6387 transitions. [2019-12-07 18:35:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:52,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-12-07 18:35:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:52,255 INFO L225 Difference]: With dead ends: 4484 [2019-12-07 18:35:52,255 INFO L226 Difference]: Without dead ends: 2480 [2019-12-07 18:35:52,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-12-07 18:35:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2480. [2019-12-07 18:35:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2480 states. [2019-12-07 18:35:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3528 transitions. [2019-12-07 18:35:52,331 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3528 transitions. Word has length 441 [2019-12-07 18:35:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 2480 states and 3528 transitions. [2019-12-07 18:35:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3528 transitions. [2019-12-07 18:35:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-12-07 18:35:52,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:52,338 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:52,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:52,539 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -699120285, now seen corresponding path program 1 times [2019-12-07 18:35:52,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:52,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18853829] [2019-12-07 18:35:52,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-12-07 18:35:52,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18853829] [2019-12-07 18:35:52,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908772640] [2019-12-07 18:35:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:52,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:52,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-12-07 18:35:52,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:52,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:35:52,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752847317] [2019-12-07 18:35:52,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:52,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:52,863 INFO L87 Difference]: Start difference. First operand 2480 states and 3528 transitions. Second operand 3 states. [2019-12-07 18:35:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:52,936 INFO L93 Difference]: Finished difference Result 5462 states and 7775 transitions. [2019-12-07 18:35:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:52,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-12-07 18:35:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:52,941 INFO L225 Difference]: With dead ends: 5462 [2019-12-07 18:35:52,941 INFO L226 Difference]: Without dead ends: 2989 [2019-12-07 18:35:52,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-07 18:35:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2989. [2019-12-07 18:35:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-07 18:35:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4248 transitions. [2019-12-07 18:35:52,999 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4248 transitions. Word has length 442 [2019-12-07 18:35:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:52,999 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 4248 transitions. [2019-12-07 18:35:52,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4248 transitions. [2019-12-07 18:35:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-12-07 18:35:53,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:53,004 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:53,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:53,204 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash -517858284, now seen corresponding path program 1 times [2019-12-07 18:35:53,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:53,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712747952] [2019-12-07 18:35:53,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-12-07 18:35:53,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712747952] [2019-12-07 18:35:53,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061467292] [2019-12-07 18:35:53,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:53,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:53,419 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-12-07 18:35:53,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:35:53,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:35:53,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644518498] [2019-12-07 18:35:53,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:53,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:53,561 INFO L87 Difference]: Start difference. First operand 2989 states and 4248 transitions. Second operand 3 states. [2019-12-07 18:35:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:53,639 INFO L93 Difference]: Finished difference Result 6439 states and 9162 transitions. [2019-12-07 18:35:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:53,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-12-07 18:35:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:53,644 INFO L225 Difference]: With dead ends: 6439 [2019-12-07 18:35:53,644 INFO L226 Difference]: Without dead ends: 3457 [2019-12-07 18:35:53,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2019-12-07 18:35:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3457. [2019-12-07 18:35:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2019-12-07 18:35:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4915 transitions. [2019-12-07 18:35:53,709 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4915 transitions. Word has length 443 [2019-12-07 18:35:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:53,709 INFO L462 AbstractCegarLoop]: Abstraction has 3457 states and 4915 transitions. [2019-12-07 18:35:53,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4915 transitions. [2019-12-07 18:35:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-12-07 18:35:53,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:53,716 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:53,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:53,917 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1394872725, now seen corresponding path program 1 times [2019-12-07 18:35:53,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:53,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006458460] [2019-12-07 18:35:53,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-12-07 18:35:54,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006458460] [2019-12-07 18:35:54,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968237766] [2019-12-07 18:35:54,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:54,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:54,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-12-07 18:35:54,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:54,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:35:54,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973052352] [2019-12-07 18:35:54,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:54,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:54,369 INFO L87 Difference]: Start difference. First operand 3457 states and 4915 transitions. Second operand 4 states. [2019-12-07 18:35:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:54,549 INFO L93 Difference]: Finished difference Result 6879 states and 9779 transitions. [2019-12-07 18:35:54,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:35:54,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 594 [2019-12-07 18:35:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:54,553 INFO L225 Difference]: With dead ends: 6879 [2019-12-07 18:35:54,553 INFO L226 Difference]: Without dead ends: 3352 [2019-12-07 18:35:54,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-12-07 18:35:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3092. [2019-12-07 18:35:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-12-07 18:35:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-12-07 18:35:54,609 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 594 [2019-12-07 18:35:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:54,610 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-12-07 18:35:54,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-12-07 18:35:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1015 [2019-12-07 18:35:54,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:54,618 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:54,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:54,819 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:54,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1182493111, now seen corresponding path program 1 times [2019-12-07 18:35:54,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:54,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826178843] [2019-12-07 18:35:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-12-07 18:35:55,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826178843] [2019-12-07 18:35:55,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388104269] [2019-12-07 18:35:55,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:55,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:35:55,517 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-12-07 18:35:55,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:55,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:35:55,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582911153] [2019-12-07 18:35:55,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:55,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:55,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:55,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:55,998 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 4 states. [2019-12-07 18:35:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:56,152 INFO L93 Difference]: Finished difference Result 7201 states and 9931 transitions. [2019-12-07 18:35:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:56,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1014 [2019-12-07 18:35:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:56,156 INFO L225 Difference]: With dead ends: 7201 [2019-12-07 18:35:56,156 INFO L226 Difference]: Without dead ends: 3932 [2019-12-07 18:35:56,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:35:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-12-07 18:35:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3092. [2019-12-07 18:35:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-12-07 18:35:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4239 transitions. [2019-12-07 18:35:56,215 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4239 transitions. Word has length 1014 [2019-12-07 18:35:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:56,216 INFO L462 AbstractCegarLoop]: Abstraction has 3092 states and 4239 transitions. [2019-12-07 18:35:56,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4239 transitions. [2019-12-07 18:35:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2019-12-07 18:35:56,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:56,226 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:56,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:56,427 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 283829187, now seen corresponding path program 1 times [2019-12-07 18:35:56,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:56,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651652653] [2019-12-07 18:35:56,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-12-07 18:35:57,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651652653] [2019-12-07 18:35:57,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:57,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:57,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249136242] [2019-12-07 18:35:57,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:57,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:57,266 INFO L87 Difference]: Start difference. First operand 3092 states and 4239 transitions. Second operand 3 states. [2019-12-07 18:35:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:57,375 INFO L93 Difference]: Finished difference Result 6327 states and 8667 transitions. [2019-12-07 18:35:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:57,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1264 [2019-12-07 18:35:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:57,379 INFO L225 Difference]: With dead ends: 6327 [2019-12-07 18:35:57,379 INFO L226 Difference]: Without dead ends: 3218 [2019-12-07 18:35:57,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-12-07 18:35:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3148. [2019-12-07 18:35:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-12-07 18:35:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4298 transitions. [2019-12-07 18:35:57,435 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4298 transitions. Word has length 1264 [2019-12-07 18:35:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:57,435 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 4298 transitions. [2019-12-07 18:35:57,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4298 transitions. [2019-12-07 18:35:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-12-07 18:35:57,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:57,445 INFO L410 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:57,445 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 515038815, now seen corresponding path program 1 times [2019-12-07 18:35:57,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:57,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548620804] [2019-12-07 18:35:57,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-12-07 18:35:58,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548620804] [2019-12-07 18:35:58,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:58,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:58,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132883770] [2019-12-07 18:35:58,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:58,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:58,193 INFO L87 Difference]: Start difference. First operand 3148 states and 4298 transitions. Second operand 3 states. [2019-12-07 18:35:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:58,278 INFO L93 Difference]: Finished difference Result 4148 states and 5651 transitions. [2019-12-07 18:35:58,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:58,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1294 [2019-12-07 18:35:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:58,278 INFO L225 Difference]: With dead ends: 4148 [2019-12-07 18:35:58,278 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:35:58,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:35:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:35:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:35:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:35:58,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1294 [2019-12-07 18:35:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:58,281 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:35:58,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:35:58,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:35:58,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:35:58,599 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-12-07 18:35:58,838 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 134 [2019-12-07 18:35:59,359 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-12-07 18:35:59,505 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 18:35:59,941 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-12-07 18:36:00,347 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-12-07 18:36:01,003 WARN L192 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-12-07 18:36:01,498 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-12-07 18:36:01,963 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-12-07 18:36:02,571 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-12-07 18:36:02,938 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-12-07 18:36:03,471 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-12-07 18:36:03,825 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2019-12-07 18:36:04,088 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-07 18:36:04,571 WARN L192 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2019-12-07 18:36:05,196 WARN L192 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-12-07 18:36:05,481 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 18:36:05,899 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-12-07 18:36:06,598 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2019-12-07 18:36:07,004 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-12-07 18:36:07,390 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2019-12-07 18:36:07,600 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 18:36:08,104 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2019-12-07 18:36:08,107 INFO L246 CegarLoopResult]: For program point L498(lines 498 501) no Hoare annotation was computed. [2019-12-07 18:36:08,107 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-12-07 18:36:08,107 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-12-07 18:36:08,107 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-12-07 18:36:08,108 INFO L242 CegarLoopResult]: At program point L201(lines 197 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27))) [2019-12-07 18:36:08,108 INFO L242 CegarLoopResult]: At program point L102(lines 101 601) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-12-07 18:36:08,108 INFO L249 CegarLoopResult]: At program point L631(lines 10 633) the Hoare annotation is: true [2019-12-07 18:36:08,109 INFO L242 CegarLoopResult]: At program point L565(lines 98 620) the Hoare annotation is: (let ((.cse22 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse12 (not .cse22)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse9 .cse10) (and .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse12) (and .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse7 (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)) .cse20 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse2 .cse15 .cse3 .cse5 .cse17 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse18 .cse19 .cse10 .cse4 .cse6 .cse9 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 .cse22)))) [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L533-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L203(lines 203 567) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L170(lines 170 578) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L137(lines 137 589) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L104(lines 104 600) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-12-07 18:36:08,109 INFO L242 CegarLoopResult]: At program point L204(lines 203 567) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-12-07 18:36:08,109 INFO L242 CegarLoopResult]: At program point L171(lines 167 579) the Hoare annotation is: (let ((.cse29 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not .cse29))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse4 .cse26 .cse5 .cse6 .cse7 .cse20 .cse9 .cse27 .cse10 .cse11 .cse13 .cse22 .cse23 .cse15 .cse28 .cse24) (and .cse4 .cse26 .cse5 .cse6 .cse7 .cse20 .cse29 .cse9 .cse27 .cse10 .cse11 .cse13 .cse22 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse28 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2019-12-07 18:36:08,110 INFO L242 CegarLoopResult]: At program point L138(lines 134 590) the Hoare annotation is: (let ((.cse12 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse21 .cse12 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse10 .cse14 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 .cse19 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse21 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse10 .cse14 .cse27) (and .cse28 .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse11 .cse21 .cse22 .cse23 .cse24 .cse25 .cse5 .cse26 .cse10 .cse14 .cse27))) [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L602(lines 602 618) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L503(lines 503 513) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L242 CegarLoopResult]: At program point L206(lines 205 567) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L173(lines 173 577) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L140(lines 140 588) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L107(lines 107 599) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L603(lines 603 617) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L604(lines 604 609) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L604-2(lines 603 617) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L506(lines 506 512) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-12-07 18:36:08,110 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L176(lines 176 576) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L143(lines 143 587) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L110(lines 110 598) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L606(lines 606 608) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L474(lines 474 484) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-12-07 18:36:08,111 INFO L242 CegarLoopResult]: At program point L210(lines 104 600) the Hoare annotation is: (let ((.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse29 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23 .cse24) (and .cse26 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2019-12-07 18:36:08,111 INFO L242 CegarLoopResult]: At program point L177(lines 173 577) the Hoare annotation is: (let ((.cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse27 (not .cse20)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2019-12-07 18:36:08,112 INFO L242 CegarLoopResult]: At program point L144(lines 140 588) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse25 (not .cse28)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse26 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 .cse27 .cse24) (and .cse26 .cse5 .cse6 .cse20 .cse28 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse24)))) [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L542(lines 542 546) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L509(lines 509 511) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L542-2(lines 542 546) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L509-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L179(lines 179 575) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L146(lines 146 586) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L113(lines 113 597) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L477(lines 477 483) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L477-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-12-07 18:36:08,112 INFO L249 CegarLoopResult]: At program point L643(lines 634 645) the Hoare annotation is: true [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L611(lines 611 615) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L182(lines 182 574) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L149(lines 149 585) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L116(lines 116 596) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L246 CegarLoopResult]: For program point L480(lines 480 482) no Hoare annotation was computed. [2019-12-07 18:36:08,113 INFO L242 CegarLoopResult]: At program point L183(lines 179 575) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse27 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2019-12-07 18:36:08,114 INFO L242 CegarLoopResult]: At program point L150(lines 146 586) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse5 .cse6 .cse26 .cse7 .cse20 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 .cse27 .cse24) (and .cse5 .cse26 .cse6 .cse7 .cse20 .cse28 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse22 .cse13 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2019-12-07 18:36:08,114 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-12-07 18:36:08,114 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-12-07 18:36:08,114 INFO L242 CegarLoopResult]: At program point L481(lines 71 632) the Hoare annotation is: false [2019-12-07 18:36:08,114 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-12-07 18:36:08,114 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse25 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse5 .cse6 .cse26 .cse7 .cse20 .cse9 .cse10 .cse12 .cse22 .cse13 .cse23 .cse15 .cse27 .cse24) (and .cse5 .cse26 .cse6 .cse7 .cse20 .cse28 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse22 .cse13 .cse23 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25)))) [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L185(lines 185 573) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L152(lines 152 584) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L119(lines 119 595) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse21 .cse13 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse23) (and .cse28 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse21 .cse13 .cse22 .cse15 .cse27 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-12-07 18:36:08,115 INFO L242 CegarLoopResult]: At program point L120(lines 116 596) the Hoare annotation is: (let ((.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse7 (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))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse28 (not .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse4 .cse20 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse21 .cse12 .cse22 .cse14 .cse23 .cse24 .cse25 .cse26 .cse5 .cse27 .cse11 .cse13 .cse28) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse29 .cse16 .cse17 .cse18 .cse19 .cse0 .cse2 .cse3 .cse4 .cse20 .cse7 .cse9 .cse10 .cse21 .cse12 .cse22 .cse14 .cse23 .cse24 .cse25 .cse26 .cse5 .cse27 .cse11 .cse13 .cse28)))) [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 18:36:08,115 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L188(lines 188 572) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L155(lines 155 583) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L122(lines 122 594) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 632) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L552(lines 552 558) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L519(lines 519 522) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L552-1(lines 552 558) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-12-07 18:36:08,116 INFO L242 CegarLoopResult]: At program point L189(lines 185 573) the Hoare annotation is: (let ((.cse27 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse28 (not .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28)))) [2019-12-07 18:36:08,116 INFO L242 CegarLoopResult]: At program point L156(lines 152 584) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse21 .cse13 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse23) (and .cse28 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse21 .cse13 .cse22 .cse15 .cse27 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-12-07 18:36:08,117 INFO L242 CegarLoopResult]: At program point L123(lines 122 594) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 492) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L191(lines 191 571) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L158(lines 158 582) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L125(lines 125 593) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L249 CegarLoopResult]: At program point L621(lines 97 622) the Hoare annotation is: true [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L555(lines 555 557) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-12-07 18:36:08,117 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L194(lines 194 570) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L161(lines 161 581) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L246 CegarLoopResult]: For program point L128(lines 128 592) no Hoare annotation was computed. [2019-12-07 18:36:08,118 INFO L242 CegarLoopResult]: At program point L195(lines 191 571) the Hoare annotation is: (let ((.cse25 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse26 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse27 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse28 .cse22 .cse23 .cse24))) [2019-12-07 18:36:08,118 INFO L242 CegarLoopResult]: At program point L162(lines 158 582) the Hoare annotation is: (let ((.cse28 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse28))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse4 .cse5 .cse26 .cse6 .cse19 .cse8 .cse9 .cse11 .cse21 .cse12 .cse22 .cse14 .cse27 .cse23) (and .cse4 .cse26 .cse5 .cse6 .cse19 .cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse8 .cse9 .cse11 .cse21 .cse12 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse14 .cse27 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L626(lines 626 628) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L626-2(lines 626 628) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L527(lines 527 537) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L197(lines 197 569) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L164(lines 164 580) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point L131(lines 131 591) no Hoare annotation was computed. [2019-12-07 18:36:08,119 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 620) the Hoare annotation is: (let ((.cse22 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse12 (not .cse22)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse9 .cse10) (and .cse11 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse12) (and .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse7 (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)) .cse20 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse2 .cse15 .cse3 .cse5 .cse17 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse16 .cse18 .cse19 .cse10 .cse4 .cse6 .cse9 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 .cse22)))) [2019-12-07 18:36:08,119 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-12-07 18:36:08,120 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse26 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse25 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse24 (not .cse26))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse25 .cse5 .cse6 .cse7 .cse26 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse12 .cse21 .cse13 .cse22 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse27 .cse23) (and .cse28 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse21 .cse13 .cse22 .cse15 .cse27 .cse23) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2019-12-07 18:36:08,120 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-12-07 18:36:08,120 INFO L242 CegarLoopResult]: At program point L165(lines 164 580) the Hoare annotation is: (let ((.cse30 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse26 (not .cse30)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse28 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse27 .cse28 .cse29) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse27 .cse28 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse29 .cse30) (and .cse5 .cse6 .cse7 .cse8 .cse22 .cse30 .cse10 .cse11 .cse12 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse15 .cse24 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse25)))) [2019-12-07 18:36:08,120 INFO L242 CegarLoopResult]: At program point L132(lines 125 593) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse28 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse29 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse30 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse22 .cse10 .cse12 .cse23 .cse14 .cse24 .cse25 .cse26 .cse27 .cse6 .cse28 .cse11 .cse13 .cse16 .cse29) (and .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse12 .cse23 .cse30 .cse14 .cse24 .cse25 .cse26 .cse27 .cse6 .cse28 .cse11 .cse13 .cse16 .cse29) (and .cse0 .cse17 .cse18 .cse19 .cse20 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse12 .cse23 .cse14 .cse24 .cse25 .cse26 .cse27 .cse6 .cse28 .cse11 .cse13 .cse16 .cse29) (and .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16))) [2019-12-07 18:36:08,120 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 18:36:08,120 INFO L246 CegarLoopResult]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-12-07 18:36:08,120 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-12-07 18:36:08,120 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-12-07 18:36:08,121 INFO L246 CegarLoopResult]: For program point L200(lines 200 568) no Hoare annotation was computed. [2019-12-07 18:36:08,121 INFO L246 CegarLoopResult]: For program point L167(lines 167 579) no Hoare annotation was computed. [2019-12-07 18:36:08,121 INFO L246 CegarLoopResult]: For program point L134(lines 134 590) no Hoare annotation was computed. [2019-12-07 18:36:08,121 INFO L246 CegarLoopResult]: For program point L101(lines 101 601) no Hoare annotation was computed. [2019-12-07 18:36:08,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:36:08 BoogieIcfgContainer [2019-12-07 18:36:08,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:36:08,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:36:08,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:36:08,180 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:36:08,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:35:45" (3/4) ... [2019-12-07 18:36:08,182 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:36:08,198 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:36:08,199 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:36:08,296 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_88d8a5f0-91ac-471e-b5e2-c69a77b746b7/bin/uautomizer/witness.graphml [2019-12-07 18:36:08,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:36:08,297 INFO L168 Benchmark]: Toolchain (without parser) took 23586.98 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 946.3 MB in the beginning and 1.3 GB in the end (delta: -357.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:36:08,297 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:36:08,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:36:08,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:36:08,298 INFO L168 Benchmark]: Boogie Preprocessor took 24.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:36:08,298 INFO L168 Benchmark]: RCFGBuilder took 423.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:36:08,298 INFO L168 Benchmark]: TraceAbstraction took 22721.70 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -329.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 18:36:08,298 INFO L168 Benchmark]: Witness Printer took 116.61 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:36:08,299 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22721.70 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -329.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 116.61 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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: 634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((8448 <= s__state && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && 0 == s__hit) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 3 == blastFlag) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state <= 3 || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (4 == blastFlag && !(0 == s__hit))) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292))) || (blastFlag <= 2 && !(0 == s__hit))) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((!(s__state == 8577) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292)) && 0 == s__hit) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8608) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit))) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && 3 == blastFlag) && s__state <= 8448) && 0 == s__hit)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state <= 3 || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && 8448 <= s__state) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (4 == blastFlag && !(0 == s__hit))) || ((((((((blastFlag <= 2 && !(s__state == 8577)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292))) || (blastFlag <= 2 && !(0 == s__hit))) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((!(s__state == 8577) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && !(s__state == 8657)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 12292)) && 0 == s__hit) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 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)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 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)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && 4 == blastFlag) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480))) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && 4 == blastFlag) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && 3 == blastFlag) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit))) || (((((((((((((((((!(s__state == 8513) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 3 == blastFlag) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. Result: SAFE, OverallTime: 12.7s, OverallIterations: 39, TraceHistogramMax: 46, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, HoareTripleCheckerStatistics: 7425 SDtfs, 5594 SDslu, 2523 SDs, 0 SdLazy, 3264 SolverSat, 1331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3651 GetRequests, 3598 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 1350 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 271 NumberOfFragments, 7979 HoareAnnotationTreeSize, 28 FomulaSimplifications, 40550 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 10733 FormulaSimplificationTreeSizeReductionInter, 9.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 13581 NumberOfCodeBlocks, 13581 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 13535 ConstructedInterpolants, 0 QuantifiedInterpolants, 9879497 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5422 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 92901/93135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...