./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49452e318e3c9c4b1e038ab7778998d33b04e5b2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:45:04,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:45:04,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:45:04,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:45:04,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:45:04,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:45:04,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:45:04,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:45:04,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:45:04,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:45:04,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:45:04,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:45:04,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:45:04,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:45:04,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:45:04,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:45:04,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:45:04,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:45:04,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:45:04,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:45:04,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:45:04,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:45:04,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:45:04,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:45:04,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:45:04,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:45:04,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:45:04,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:45:04,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:45:04,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:45:04,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:45:04,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:45:04,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:45:04,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:45:04,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:45:04,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:45:04,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:45:04,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:45:04,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:45:04,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:45:04,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:45:04,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:45:04,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:45:04,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:45:04,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:45:04,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:45:04,399 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:45:04,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:45:04,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:45:04,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:45:04,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:45:04,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:45:04,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:45:04,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:45:04,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:45:04,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:45:04,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:45:04,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:45:04,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:45:04,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:45:04,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:45:04,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:45:04,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:45:04,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:45:04,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:45:04,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:45:04,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:45:04,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:45:04,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:45:04,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:45:04,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:45:04,402 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_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-12-07 14:45:04,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:45:04,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:45:04,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:45:04,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:45:04,511 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:45:04,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-12-07 14:45:04,548 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/data/11ad94771/4209c282c8394affa12c07806034e00c/FLAGd53713d90 [2019-12-07 14:45:05,002 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:45:05,003 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-12-07 14:45:05,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/data/11ad94771/4209c282c8394affa12c07806034e00c/FLAGd53713d90 [2019-12-07 14:45:05,019 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/data/11ad94771/4209c282c8394affa12c07806034e00c [2019-12-07 14:45:05,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:45:05,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:45:05,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:45:05,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:45:05,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:45:05,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,027 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 02:45:05, skipping insertion in model container [2019-12-07 14:45:05,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:45:05,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:45:05,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:45:05,234 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:45:05,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:45:05,278 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:45:05,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05 WrapperNode [2019-12-07 14:45:05,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:45:05,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:45:05,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:45:05,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:45:05,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:45:05,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:45:05,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:45:05,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:45:05,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... [2019-12-07 14:45:05,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:45:05,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:45:05,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:45:05,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:45:05,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/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 14:45:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:45:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:45:05,449 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:45:05,747 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 14:45:05,747 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 14:45:05,748 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:45:05,748 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:45:05,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:45:05 BoogieIcfgContainer [2019-12-07 14:45:05,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:45:05,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:45:05,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:45:05,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:45:05,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:45:05" (1/3) ... [2019-12-07 14:45:05,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3981ec2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:45:05, skipping insertion in model container [2019-12-07 14:45:05,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:45:05" (2/3) ... [2019-12-07 14:45:05,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3981ec2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:45:05, skipping insertion in model container [2019-12-07 14:45:05,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:45:05" (3/3) ... [2019-12-07 14:45:05,754 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-12-07 14:45:05,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:45:05,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:45:05,773 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:45:05,790 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:45:05,790 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:45:05,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:45:05,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:45:05,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:45:05,790 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:45:05,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:45:05,791 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:45:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-07 14:45:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:45:05,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:05,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:05,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:05,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:05,814 INFO L82 PathProgramCache]: Analyzing trace with hash -91611738, now seen corresponding path program 1 times [2019-12-07 14:45:05,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:05,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881183703] [2019-12-07 14:45:05,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:05,955 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 14:45:05,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881183703] [2019-12-07 14:45:05,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:05,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:05,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190228904] [2019-12-07 14:45:05,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:05,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:05,971 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-12-07 14:45:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,133 INFO L93 Difference]: Finished difference Result 327 states and 564 transitions. [2019-12-07 14:45:06,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:06,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 14:45:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,143 INFO L225 Difference]: With dead ends: 327 [2019-12-07 14:45:06,143 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 14:45:06,145 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 14:45:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 14:45:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2019-12-07 14:45:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 14:45:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 273 transitions. [2019-12-07 14:45:06,180 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 273 transitions. Word has length 43 [2019-12-07 14:45:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:06,181 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 273 transitions. [2019-12-07 14:45:06,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 273 transitions. [2019-12-07 14:45:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 14:45:06,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:06,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:06,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1448027309, now seen corresponding path program 1 times [2019-12-07 14:45:06,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:06,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431877147] [2019-12-07 14:45:06,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:06,224 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 14:45:06,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431877147] [2019-12-07 14:45:06,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:06,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:06,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947646801] [2019-12-07 14:45:06,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:06,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:06,226 INFO L87 Difference]: Start difference. First operand 167 states and 273 transitions. Second operand 3 states. [2019-12-07 14:45:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,354 INFO L93 Difference]: Finished difference Result 376 states and 623 transitions. [2019-12-07 14:45:06,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:06,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 14:45:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,357 INFO L225 Difference]: With dead ends: 376 [2019-12-07 14:45:06,357 INFO L226 Difference]: Without dead ends: 214 [2019-12-07 14:45:06,359 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 14:45:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-07 14:45:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-12-07 14:45:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-07 14:45:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 350 transitions. [2019-12-07 14:45:06,376 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 350 transitions. Word has length 44 [2019-12-07 14:45:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:06,376 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 350 transitions. [2019-12-07 14:45:06,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 350 transitions. [2019-12-07 14:45:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:45:06,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:06,380 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:06,380 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1909160843, now seen corresponding path program 1 times [2019-12-07 14:45:06,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:06,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185998622] [2019-12-07 14:45:06,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:06,425 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 14:45:06,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185998622] [2019-12-07 14:45:06,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:06,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:06,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628994286] [2019-12-07 14:45:06,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:06,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:06,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:06,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:06,426 INFO L87 Difference]: Start difference. First operand 208 states and 350 transitions. Second operand 3 states. [2019-12-07 14:45:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,537 INFO L93 Difference]: Finished difference Result 440 states and 747 transitions. [2019-12-07 14:45:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:06,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 14:45:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,539 INFO L225 Difference]: With dead ends: 440 [2019-12-07 14:45:06,539 INFO L226 Difference]: Without dead ends: 239 [2019-12-07 14:45:06,540 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 14:45:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-12-07 14:45:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-12-07 14:45:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 14:45:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 406 transitions. [2019-12-07 14:45:06,552 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 406 transitions. Word has length 72 [2019-12-07 14:45:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:06,552 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 406 transitions. [2019-12-07 14:45:06,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 406 transitions. [2019-12-07 14:45:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 14:45:06,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:06,554 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:06,554 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1091248829, now seen corresponding path program 1 times [2019-12-07 14:45:06,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:06,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830674170] [2019-12-07 14:45:06,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:06,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830674170] [2019-12-07 14:45:06,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:06,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:06,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926902434] [2019-12-07 14:45:06,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:06,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:06,600 INFO L87 Difference]: Start difference. First operand 239 states and 406 transitions. Second operand 3 states. [2019-12-07 14:45:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,715 INFO L93 Difference]: Finished difference Result 517 states and 883 transitions. [2019-12-07 14:45:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:06,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 14:45:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,723 INFO L225 Difference]: With dead ends: 517 [2019-12-07 14:45:06,723 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 14:45:06,724 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 14:45:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 14:45:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-12-07 14:45:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-12-07 14:45:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 481 transitions. [2019-12-07 14:45:06,738 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 481 transitions. Word has length 83 [2019-12-07 14:45:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:06,738 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 481 transitions. [2019-12-07 14:45:06,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 481 transitions. [2019-12-07 14:45:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:45:06,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:06,740 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:06,740 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash 448380383, now seen corresponding path program 1 times [2019-12-07 14:45:06,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:06,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694225152] [2019-12-07 14:45:06,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:06,773 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 14:45:06,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694225152] [2019-12-07 14:45:06,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:06,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:06,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795745068] [2019-12-07 14:45:06,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:06,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:06,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:06,774 INFO L87 Difference]: Start difference. First operand 281 states and 481 transitions. Second operand 3 states. [2019-12-07 14:45:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,841 INFO L93 Difference]: Finished difference Result 572 states and 979 transitions. [2019-12-07 14:45:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:06,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 14:45:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,843 INFO L225 Difference]: With dead ends: 572 [2019-12-07 14:45:06,843 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 14:45:06,844 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 14:45:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 14:45:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-12-07 14:45:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 14:45:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 503 transitions. [2019-12-07 14:45:06,854 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 503 transitions. Word has length 84 [2019-12-07 14:45:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:06,854 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 503 transitions. [2019-12-07 14:45:06,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 503 transitions. [2019-12-07 14:45:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:45:06,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:06,855 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:06,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash 429685604, now seen corresponding path program 1 times [2019-12-07 14:45:06,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:06,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188034258] [2019-12-07 14:45:06,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:45:06,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188034258] [2019-12-07 14:45:06,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:06,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:06,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704528119] [2019-12-07 14:45:06,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:06,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:06,896 INFO L87 Difference]: Start difference. First operand 296 states and 503 transitions. Second operand 3 states. [2019-12-07 14:45:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:06,993 INFO L93 Difference]: Finished difference Result 589 states and 1000 transitions. [2019-12-07 14:45:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:06,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 14:45:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:06,997 INFO L225 Difference]: With dead ends: 589 [2019-12-07 14:45:06,997 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 14:45:06,998 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 14:45:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 14:45:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-12-07 14:45:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 14:45:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-12-07 14:45:07,008 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-12-07 14:45:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,008 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-12-07 14:45:07,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-12-07 14:45:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:45:07,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,010 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash -52731309, now seen corresponding path program 1 times [2019-12-07 14:45:07,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988955989] [2019-12-07 14:45:07,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,040 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 14:45:07,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988955989] [2019-12-07 14:45:07,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211874349] [2019-12-07 14:45:07,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,041 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 3 states. [2019-12-07 14:45:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,118 INFO L93 Difference]: Finished difference Result 583 states and 987 transitions. [2019-12-07 14:45:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 14:45:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,120 INFO L225 Difference]: With dead ends: 583 [2019-12-07 14:45:07,120 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 14:45:07,120 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 14:45:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 14:45:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-12-07 14:45:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 14:45:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 494 transitions. [2019-12-07 14:45:07,127 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 494 transitions. Word has length 85 [2019-12-07 14:45:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,127 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 494 transitions. [2019-12-07 14:45:07,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 494 transitions. [2019-12-07 14:45:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:45:07,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,128 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,128 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash -825774373, now seen corresponding path program 1 times [2019-12-07 14:45:07,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620216584] [2019-12-07 14:45:07,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,153 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 14:45:07,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620216584] [2019-12-07 14:45:07,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31544417] [2019-12-07 14:45:07,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,154 INFO L87 Difference]: Start difference. First operand 294 states and 494 transitions. Second operand 3 states. [2019-12-07 14:45:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,222 INFO L93 Difference]: Finished difference Result 589 states and 988 transitions. [2019-12-07 14:45:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 14:45:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,224 INFO L225 Difference]: With dead ends: 589 [2019-12-07 14:45:07,224 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 14:45:07,224 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 14:45:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 14:45:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-12-07 14:45:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-12-07 14:45:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 499 transitions. [2019-12-07 14:45:07,231 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 499 transitions. Word has length 97 [2019-12-07 14:45:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,231 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 499 transitions. [2019-12-07 14:45:07,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 499 transitions. [2019-12-07 14:45:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:45:07,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,232 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,232 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1871019140, now seen corresponding path program 1 times [2019-12-07 14:45:07,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882872297] [2019-12-07 14:45:07,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,259 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 14:45:07,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882872297] [2019-12-07 14:45:07,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589313933] [2019-12-07 14:45:07,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,261 INFO L87 Difference]: Start difference. First operand 302 states and 499 transitions. Second operand 3 states. [2019-12-07 14:45:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,353 INFO L93 Difference]: Finished difference Result 628 states and 1040 transitions. [2019-12-07 14:45:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 14:45:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,356 INFO L225 Difference]: With dead ends: 628 [2019-12-07 14:45:07,356 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 14:45:07,357 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 14:45:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 14:45:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-12-07 14:45:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-07 14:45:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 546 transitions. [2019-12-07 14:45:07,367 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 546 transitions. Word has length 98 [2019-12-07 14:45:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,368 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 546 transitions. [2019-12-07 14:45:07,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 546 transitions. [2019-12-07 14:45:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:45:07,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,369 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,369 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1449457736, now seen corresponding path program 1 times [2019-12-07 14:45:07,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142631936] [2019-12-07 14:45:07,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,398 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 14:45:07,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142631936] [2019-12-07 14:45:07,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9241606] [2019-12-07 14:45:07,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,400 INFO L87 Difference]: Start difference. First operand 331 states and 546 transitions. Second operand 3 states. [2019-12-07 14:45:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,504 INFO L93 Difference]: Finished difference Result 689 states and 1140 transitions. [2019-12-07 14:45:07,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 14:45:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,507 INFO L225 Difference]: With dead ends: 689 [2019-12-07 14:45:07,507 INFO L226 Difference]: Without dead ends: 365 [2019-12-07 14:45:07,508 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 14:45:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-07 14:45:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-12-07 14:45:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 14:45:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 588 transitions. [2019-12-07 14:45:07,520 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 588 transitions. Word has length 99 [2019-12-07 14:45:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,520 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 588 transitions. [2019-12-07 14:45:07,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 588 transitions. [2019-12-07 14:45:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:45:07,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,522 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,522 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1215142768, now seen corresponding path program 1 times [2019-12-07 14:45:07,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801747357] [2019-12-07 14:45:07,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,550 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 14:45:07,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801747357] [2019-12-07 14:45:07,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431265805] [2019-12-07 14:45:07,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,552 INFO L87 Difference]: Start difference. First operand 358 states and 588 transitions. Second operand 3 states. [2019-12-07 14:45:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,649 INFO L93 Difference]: Finished difference Result 711 states and 1167 transitions. [2019-12-07 14:45:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 14:45:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,651 INFO L225 Difference]: With dead ends: 711 [2019-12-07 14:45:07,651 INFO L226 Difference]: Without dead ends: 360 [2019-12-07 14:45:07,652 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 14:45:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-07 14:45:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2019-12-07 14:45:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 14:45:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 584 transitions. [2019-12-07 14:45:07,660 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 584 transitions. Word has length 99 [2019-12-07 14:45:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,660 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 584 transitions. [2019-12-07 14:45:07,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 584 transitions. [2019-12-07 14:45:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 14:45:07,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,662 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,662 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash -32577404, now seen corresponding path program 1 times [2019-12-07 14:45:07,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865247311] [2019-12-07 14:45:07,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,688 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 14:45:07,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865247311] [2019-12-07 14:45:07,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518003708] [2019-12-07 14:45:07,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,690 INFO L87 Difference]: Start difference. First operand 358 states and 584 transitions. Second operand 3 states. [2019-12-07 14:45:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,786 INFO L93 Difference]: Finished difference Result 716 states and 1169 transitions. [2019-12-07 14:45:07,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 14:45:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,789 INFO L225 Difference]: With dead ends: 716 [2019-12-07 14:45:07,789 INFO L226 Difference]: Without dead ends: 365 [2019-12-07 14:45:07,790 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 14:45:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-12-07 14:45:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-12-07 14:45:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 14:45:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 579 transitions. [2019-12-07 14:45:07,802 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 579 transitions. Word has length 100 [2019-12-07 14:45:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,802 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 579 transitions. [2019-12-07 14:45:07,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 579 transitions. [2019-12-07 14:45:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 14:45:07,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,804 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,804 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1057958359, now seen corresponding path program 1 times [2019-12-07 14:45:07,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624449660] [2019-12-07 14:45:07,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:45:07,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624449660] [2019-12-07 14:45:07,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946280999] [2019-12-07 14:45:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,832 INFO L87 Difference]: Start difference. First operand 358 states and 579 transitions. Second operand 3 states. [2019-12-07 14:45:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:07,923 INFO L93 Difference]: Finished difference Result 734 states and 1188 transitions. [2019-12-07 14:45:07,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:07,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 14:45:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:07,926 INFO L225 Difference]: With dead ends: 734 [2019-12-07 14:45:07,926 INFO L226 Difference]: Without dead ends: 383 [2019-12-07 14:45:07,926 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 14:45:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-07 14:45:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-12-07 14:45:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-07 14:45:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 608 transitions. [2019-12-07 14:45:07,936 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 608 transitions. Word has length 104 [2019-12-07 14:45:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:07,936 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 608 transitions. [2019-12-07 14:45:07,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2019-12-07 14:45:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 14:45:07,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:07,937 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:07,937 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:07,938 INFO L82 PathProgramCache]: Analyzing trace with hash -278357315, now seen corresponding path program 1 times [2019-12-07 14:45:07,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:07,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373199978] [2019-12-07 14:45:07,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:45:07,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373199978] [2019-12-07 14:45:07,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:07,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:07,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058054857] [2019-12-07 14:45:07,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:07,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:07,959 INFO L87 Difference]: Start difference. First operand 379 states and 608 transitions. Second operand 3 states. [2019-12-07 14:45:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:08,053 INFO L93 Difference]: Finished difference Result 755 states and 1211 transitions. [2019-12-07 14:45:08,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:08,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 14:45:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:08,056 INFO L225 Difference]: With dead ends: 755 [2019-12-07 14:45:08,056 INFO L226 Difference]: Without dead ends: 383 [2019-12-07 14:45:08,057 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 14:45:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-07 14:45:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-12-07 14:45:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-07 14:45:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2019-12-07 14:45:08,070 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 105 [2019-12-07 14:45:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:08,070 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2019-12-07 14:45:08,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2019-12-07 14:45:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 14:45:08,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:08,072 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:08,072 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 138382894, now seen corresponding path program 1 times [2019-12-07 14:45:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:08,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116158893] [2019-12-07 14:45:08,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:45:08,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116158893] [2019-12-07 14:45:08,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:08,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:08,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051674377] [2019-12-07 14:45:08,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:08,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:08,099 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand 3 states. [2019-12-07 14:45:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:08,141 INFO L93 Difference]: Finished difference Result 1117 states and 1778 transitions. [2019-12-07 14:45:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:08,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 14:45:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:08,144 INFO L225 Difference]: With dead ends: 1117 [2019-12-07 14:45:08,144 INFO L226 Difference]: Without dead ends: 745 [2019-12-07 14:45:08,145 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 14:45:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-12-07 14:45:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-12-07 14:45:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-12-07 14:45:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1181 transitions. [2019-12-07 14:45:08,162 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1181 transitions. Word has length 120 [2019-12-07 14:45:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:08,163 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1181 transitions. [2019-12-07 14:45:08,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1181 transitions. [2019-12-07 14:45:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 14:45:08,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:08,164 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:08,164 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2017513840, now seen corresponding path program 1 times [2019-12-07 14:45:08,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:08,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6193425] [2019-12-07 14:45:08,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 14:45:08,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6193425] [2019-12-07 14:45:08,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:08,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:08,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452243611] [2019-12-07 14:45:08,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:08,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:08,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:08,198 INFO L87 Difference]: Start difference. First operand 745 states and 1181 transitions. Second operand 3 states. [2019-12-07 14:45:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:08,251 INFO L93 Difference]: Finished difference Result 1117 states and 1772 transitions. [2019-12-07 14:45:08,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:08,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 14:45:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:08,257 INFO L225 Difference]: With dead ends: 1117 [2019-12-07 14:45:08,257 INFO L226 Difference]: Without dead ends: 1115 [2019-12-07 14:45:08,258 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 14:45:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-12-07 14:45:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2019-12-07 14:45:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-12-07 14:45:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1769 transitions. [2019-12-07 14:45:08,297 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1769 transitions. Word has length 120 [2019-12-07 14:45:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:08,298 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1769 transitions. [2019-12-07 14:45:08,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1769 transitions. [2019-12-07 14:45:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 14:45:08,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:08,308 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:08,309 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -888705079, now seen corresponding path program 1 times [2019-12-07 14:45:08,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:08,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210434660] [2019-12-07 14:45:08,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:45:08,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210434660] [2019-12-07 14:45:08,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:08,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:08,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596735090] [2019-12-07 14:45:08,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:08,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:08,335 INFO L87 Difference]: Start difference. First operand 1115 states and 1769 transitions. Second operand 3 states. [2019-12-07 14:45:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:08,462 INFO L93 Difference]: Finished difference Result 2349 states and 3730 transitions. [2019-12-07 14:45:08,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:08,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 14:45:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:08,468 INFO L225 Difference]: With dead ends: 2349 [2019-12-07 14:45:08,468 INFO L226 Difference]: Without dead ends: 1241 [2019-12-07 14:45:08,469 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 14:45:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-12-07 14:45:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1229. [2019-12-07 14:45:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-12-07 14:45:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1946 transitions. [2019-12-07 14:45:08,495 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1946 transitions. Word has length 121 [2019-12-07 14:45:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:08,495 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 1946 transitions. [2019-12-07 14:45:08,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1946 transitions. [2019-12-07 14:45:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 14:45:08,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:08,497 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:08,497 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 601692112, now seen corresponding path program 1 times [2019-12-07 14:45:08,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:08,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120577626] [2019-12-07 14:45:08,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 14:45:08,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120577626] [2019-12-07 14:45:08,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:08,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:08,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776105252] [2019-12-07 14:45:08,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:08,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:08,525 INFO L87 Difference]: Start difference. First operand 1229 states and 1946 transitions. Second operand 3 states. [2019-12-07 14:45:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:08,652 INFO L93 Difference]: Finished difference Result 2463 states and 3898 transitions. [2019-12-07 14:45:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:08,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 14:45:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:08,658 INFO L225 Difference]: With dead ends: 2463 [2019-12-07 14:45:08,658 INFO L226 Difference]: Without dead ends: 1235 [2019-12-07 14:45:08,659 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 14:45:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-12-07 14:45:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-12-07 14:45:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 14:45:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1928 transitions. [2019-12-07 14:45:08,686 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1928 transitions. Word has length 122 [2019-12-07 14:45:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:08,686 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1928 transitions. [2019-12-07 14:45:08,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1928 transitions. [2019-12-07 14:45:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 14:45:08,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:08,688 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:08,688 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1105504061, now seen corresponding path program 1 times [2019-12-07 14:45:08,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:08,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051636827] [2019-12-07 14:45:08,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 14:45:08,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051636827] [2019-12-07 14:45:08,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:08,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:08,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268631597] [2019-12-07 14:45:08,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:08,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:08,722 INFO L87 Difference]: Start difference. First operand 1223 states and 1928 transitions. Second operand 3 states. [2019-12-07 14:45:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:08,834 INFO L93 Difference]: Finished difference Result 2553 states and 4025 transitions. [2019-12-07 14:45:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:08,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-12-07 14:45:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:08,839 INFO L225 Difference]: With dead ends: 2553 [2019-12-07 14:45:08,839 INFO L226 Difference]: Without dead ends: 1337 [2019-12-07 14:45:08,840 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 14:45:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-12-07 14:45:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-12-07 14:45:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-12-07 14:45:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2090 transitions. [2019-12-07 14:45:08,868 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2090 transitions. Word has length 154 [2019-12-07 14:45:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:08,868 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 2090 transitions. [2019-12-07 14:45:08,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2090 transitions. [2019-12-07 14:45:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 14:45:08,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:08,870 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:08,870 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2116162422, now seen corresponding path program 1 times [2019-12-07 14:45:08,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:08,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562110512] [2019-12-07 14:45:08,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 14:45:08,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562110512] [2019-12-07 14:45:08,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:08,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409809377] [2019-12-07 14:45:08,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:08,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:08,898 INFO L87 Difference]: Start difference. First operand 1331 states and 2090 transitions. Second operand 3 states. [2019-12-07 14:45:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:09,023 INFO L93 Difference]: Finished difference Result 2661 states and 4175 transitions. [2019-12-07 14:45:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:09,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-12-07 14:45:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:09,028 INFO L225 Difference]: With dead ends: 2661 [2019-12-07 14:45:09,028 INFO L226 Difference]: Without dead ends: 1331 [2019-12-07 14:45:09,029 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 14:45:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-12-07 14:45:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1325. [2019-12-07 14:45:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-12-07 14:45:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2069 transitions. [2019-12-07 14:45:09,057 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2069 transitions. Word has length 155 [2019-12-07 14:45:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:09,057 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 2069 transitions. [2019-12-07 14:45:09,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2069 transitions. [2019-12-07 14:45:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 14:45:09,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:09,059 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:09,060 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash 926552750, now seen corresponding path program 1 times [2019-12-07 14:45:09,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:09,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129678844] [2019-12-07 14:45:09,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 14:45:09,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129678844] [2019-12-07 14:45:09,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:09,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:09,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056435026] [2019-12-07 14:45:09,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:09,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:09,093 INFO L87 Difference]: Start difference. First operand 1325 states and 2069 transitions. Second operand 3 states. [2019-12-07 14:45:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:09,208 INFO L93 Difference]: Finished difference Result 2751 states and 4295 transitions. [2019-12-07 14:45:09,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:09,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 14:45:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:09,213 INFO L225 Difference]: With dead ends: 2751 [2019-12-07 14:45:09,213 INFO L226 Difference]: Without dead ends: 1433 [2019-12-07 14:45:09,215 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 14:45:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-12-07 14:45:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1427. [2019-12-07 14:45:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-12-07 14:45:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2216 transitions. [2019-12-07 14:45:09,244 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2216 transitions. Word has length 185 [2019-12-07 14:45:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:09,245 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 2216 transitions. [2019-12-07 14:45:09,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2216 transitions. [2019-12-07 14:45:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 14:45:09,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:09,247 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:09,247 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash 405410805, now seen corresponding path program 1 times [2019-12-07 14:45:09,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:09,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697676751] [2019-12-07 14:45:09,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 14:45:09,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697676751] [2019-12-07 14:45:09,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:09,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:09,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672243780] [2019-12-07 14:45:09,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:09,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:09,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:09,282 INFO L87 Difference]: Start difference. First operand 1427 states and 2216 transitions. Second operand 3 states. [2019-12-07 14:45:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:09,394 INFO L93 Difference]: Finished difference Result 2853 states and 4427 transitions. [2019-12-07 14:45:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:09,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 14:45:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:09,399 INFO L225 Difference]: With dead ends: 2853 [2019-12-07 14:45:09,399 INFO L226 Difference]: Without dead ends: 1427 [2019-12-07 14:45:09,400 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 14:45:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-12-07 14:45:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1421. [2019-12-07 14:45:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-12-07 14:45:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2192 transitions. [2019-12-07 14:45:09,431 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2192 transitions. Word has length 186 [2019-12-07 14:45:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:09,431 INFO L462 AbstractCegarLoop]: Abstraction has 1421 states and 2192 transitions. [2019-12-07 14:45:09,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2192 transitions. [2019-12-07 14:45:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 14:45:09,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:09,434 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:09,434 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash 311594383, now seen corresponding path program 1 times [2019-12-07 14:45:09,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:09,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095261955] [2019-12-07 14:45:09,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 14:45:09,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095261955] [2019-12-07 14:45:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:09,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661614656] [2019-12-07 14:45:09,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:09,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:09,469 INFO L87 Difference]: Start difference. First operand 1421 states and 2192 transitions. Second operand 3 states. [2019-12-07 14:45:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:09,588 INFO L93 Difference]: Finished difference Result 2946 states and 4556 transitions. [2019-12-07 14:45:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:09,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-12-07 14:45:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:09,594 INFO L225 Difference]: With dead ends: 2946 [2019-12-07 14:45:09,594 INFO L226 Difference]: Without dead ends: 1532 [2019-12-07 14:45:09,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 14:45:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-12-07 14:45:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-12-07 14:45:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-12-07 14:45:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2288 transitions. [2019-12-07 14:45:09,636 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2288 transitions. Word has length 203 [2019-12-07 14:45:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:09,637 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2288 transitions. [2019-12-07 14:45:09,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2288 transitions. [2019-12-07 14:45:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-12-07 14:45:09,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:09,640 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:09,640 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1374927291, now seen corresponding path program 1 times [2019-12-07 14:45:09,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:09,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524704963] [2019-12-07 14:45:09,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 14:45:09,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524704963] [2019-12-07 14:45:09,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:09,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:09,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969793838] [2019-12-07 14:45:09,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:09,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:09,692 INFO L87 Difference]: Start difference. First operand 1496 states and 2288 transitions. Second operand 3 states. [2019-12-07 14:45:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:09,797 INFO L93 Difference]: Finished difference Result 3021 states and 4625 transitions. [2019-12-07 14:45:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:09,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-12-07 14:45:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:09,803 INFO L225 Difference]: With dead ends: 3021 [2019-12-07 14:45:09,803 INFO L226 Difference]: Without dead ends: 1532 [2019-12-07 14:45:09,805 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 14:45:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-12-07 14:45:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-12-07 14:45:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-12-07 14:45:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2261 transitions. [2019-12-07 14:45:09,835 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2261 transitions. Word has length 204 [2019-12-07 14:45:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:09,835 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2261 transitions. [2019-12-07 14:45:09,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2261 transitions. [2019-12-07 14:45:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-12-07 14:45:09,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:09,838 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:09,838 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:09,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1705472573, now seen corresponding path program 1 times [2019-12-07 14:45:09,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:09,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622814844] [2019-12-07 14:45:09,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 14:45:09,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622814844] [2019-12-07 14:45:09,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:09,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:09,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547115646] [2019-12-07 14:45:09,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:09,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:09,877 INFO L87 Difference]: Start difference. First operand 1496 states and 2261 transitions. Second operand 3 states. [2019-12-07 14:45:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:09,982 INFO L93 Difference]: Finished difference Result 2997 states and 4526 transitions. [2019-12-07 14:45:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:09,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-12-07 14:45:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:09,988 INFO L225 Difference]: With dead ends: 2997 [2019-12-07 14:45:09,988 INFO L226 Difference]: Without dead ends: 1508 [2019-12-07 14:45:09,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 14:45:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-12-07 14:45:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1496. [2019-12-07 14:45:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-12-07 14:45:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-12-07 14:45:10,020 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 216 [2019-12-07 14:45:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:10,020 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-12-07 14:45:10,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-12-07 14:45:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-07 14:45:10,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:10,023 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:10,023 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2105710730, now seen corresponding path program 1 times [2019-12-07 14:45:10,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:10,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544019762] [2019-12-07 14:45:10,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 14:45:10,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544019762] [2019-12-07 14:45:10,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:10,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:10,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822123286] [2019-12-07 14:45:10,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:10,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:10,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:10,063 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-12-07 14:45:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:10,174 INFO L93 Difference]: Finished difference Result 2997 states and 4490 transitions. [2019-12-07 14:45:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:10,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-12-07 14:45:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:10,180 INFO L225 Difference]: With dead ends: 2997 [2019-12-07 14:45:10,180 INFO L226 Difference]: Without dead ends: 1481 [2019-12-07 14:45:10,182 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 14:45:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-12-07 14:45:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1469. [2019-12-07 14:45:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-12-07 14:45:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2186 transitions. [2019-12-07 14:45:10,212 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2186 transitions. Word has length 217 [2019-12-07 14:45:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:10,212 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 2186 transitions. [2019-12-07 14:45:10,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2186 transitions. [2019-12-07 14:45:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-12-07 14:45:10,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:10,215 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:10,215 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 721369725, now seen corresponding path program 1 times [2019-12-07 14:45:10,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:10,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198172591] [2019-12-07 14:45:10,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 14:45:10,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198172591] [2019-12-07 14:45:10,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:10,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:10,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197252504] [2019-12-07 14:45:10,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:10,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:10,262 INFO L87 Difference]: Start difference. First operand 1469 states and 2186 transitions. Second operand 3 states. [2019-12-07 14:45:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:10,392 INFO L93 Difference]: Finished difference Result 2986 states and 4447 transitions. [2019-12-07 14:45:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:10,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-12-07 14:45:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:10,401 INFO L225 Difference]: With dead ends: 2986 [2019-12-07 14:45:10,401 INFO L226 Difference]: Without dead ends: 1524 [2019-12-07 14:45:10,403 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 14:45:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2019-12-07 14:45:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1515. [2019-12-07 14:45:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-12-07 14:45:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2230 transitions. [2019-12-07 14:45:10,447 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2230 transitions. Word has length 223 [2019-12-07 14:45:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:10,447 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2230 transitions. [2019-12-07 14:45:10,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2230 transitions. [2019-12-07 14:45:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-12-07 14:45:10,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:10,452 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:10,452 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 194394121, now seen corresponding path program 1 times [2019-12-07 14:45:10,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:10,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258483003] [2019-12-07 14:45:10,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 14:45:10,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258483003] [2019-12-07 14:45:10,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:10,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:45:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943050813] [2019-12-07 14:45:10,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:10,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:10,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:10,511 INFO L87 Difference]: Start difference. First operand 1515 states and 2230 transitions. Second operand 3 states. [2019-12-07 14:45:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:10,611 INFO L93 Difference]: Finished difference Result 2605 states and 3838 transitions. [2019-12-07 14:45:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:10,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-12-07 14:45:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:10,616 INFO L225 Difference]: With dead ends: 2605 [2019-12-07 14:45:10,616 INFO L226 Difference]: Without dead ends: 1085 [2019-12-07 14:45:10,617 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 14:45:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-12-07 14:45:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1079. [2019-12-07 14:45:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-12-07 14:45:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1573 transitions. [2019-12-07 14:45:10,638 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1573 transitions. Word has length 224 [2019-12-07 14:45:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:10,638 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1573 transitions. [2019-12-07 14:45:10,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1573 transitions. [2019-12-07 14:45:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-12-07 14:45:10,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:10,641 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:10,641 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1786104814, now seen corresponding path program 1 times [2019-12-07 14:45:10,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:10,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338687892] [2019-12-07 14:45:10,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-12-07 14:45:10,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338687892] [2019-12-07 14:45:10,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970496511] [2019-12-07 14:45:10,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/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 14:45:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:10,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:45:10,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 14:45:10,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:45:10,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 14:45:10,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907484465] [2019-12-07 14:45:10,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:10,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:10,884 INFO L87 Difference]: Start difference. First operand 1079 states and 1573 transitions. Second operand 3 states. [2019-12-07 14:45:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:10,945 INFO L93 Difference]: Finished difference Result 2658 states and 3873 transitions. [2019-12-07 14:45:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:10,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-12-07 14:45:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:10,952 INFO L225 Difference]: With dead ends: 2658 [2019-12-07 14:45:10,952 INFO L226 Difference]: Without dead ends: 1586 [2019-12-07 14:45:10,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-07 14:45:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2019-12-07 14:45:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-12-07 14:45:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2310 transitions. [2019-12-07 14:45:11,003 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2310 transitions. Word has length 260 [2019-12-07 14:45:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:11,003 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2310 transitions. [2019-12-07 14:45:11,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2310 transitions. [2019-12-07 14:45:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-12-07 14:45:11,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:11,008 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:11,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:45:11,209 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1088106038, now seen corresponding path program 1 times [2019-12-07 14:45:11,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:11,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744969607] [2019-12-07 14:45:11,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-12-07 14:45:11,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744969607] [2019-12-07 14:45:11,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:11,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:11,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141693440] [2019-12-07 14:45:11,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:11,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:11,335 INFO L87 Difference]: Start difference. First operand 1586 states and 2310 transitions. Second operand 3 states. [2019-12-07 14:45:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:11,409 INFO L93 Difference]: Finished difference Result 4663 states and 6788 transitions. [2019-12-07 14:45:11,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:11,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-12-07 14:45:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:11,417 INFO L225 Difference]: With dead ends: 4663 [2019-12-07 14:45:11,417 INFO L226 Difference]: Without dead ends: 3084 [2019-12-07 14:45:11,420 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 14:45:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2019-12-07 14:45:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3082. [2019-12-07 14:45:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-12-07 14:45:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4479 transitions. [2019-12-07 14:45:11,503 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4479 transitions. Word has length 270 [2019-12-07 14:45:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:11,503 INFO L462 AbstractCegarLoop]: Abstraction has 3082 states and 4479 transitions. [2019-12-07 14:45:11,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4479 transitions. [2019-12-07 14:45:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-12-07 14:45:11,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:11,508 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 14:45:11,508 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash 420200473, now seen corresponding path program 1 times [2019-12-07 14:45:11,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:11,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636466318] [2019-12-07 14:45:11,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-12-07 14:45:11,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636466318] [2019-12-07 14:45:11,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:11,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:11,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035620203] [2019-12-07 14:45:11,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:11,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:11,580 INFO L87 Difference]: Start difference. First operand 3082 states and 4479 transitions. Second operand 3 states. [2019-12-07 14:45:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:11,720 INFO L93 Difference]: Finished difference Result 6317 states and 9203 transitions. [2019-12-07 14:45:11,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:11,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-12-07 14:45:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:11,724 INFO L225 Difference]: With dead ends: 6317 [2019-12-07 14:45:11,724 INFO L226 Difference]: Without dead ends: 2034 [2019-12-07 14:45:11,728 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 14:45:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-12-07 14:45:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2014. [2019-12-07 14:45:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-07 14:45:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2877 transitions. [2019-12-07 14:45:11,771 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2877 transitions. Word has length 307 [2019-12-07 14:45:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:11,771 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2877 transitions. [2019-12-07 14:45:11,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2877 transitions. [2019-12-07 14:45:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-12-07 14:45:11,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:11,776 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:11,776 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash 982370538, now seen corresponding path program 1 times [2019-12-07 14:45:11,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:11,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058365056] [2019-12-07 14:45:11,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 14:45:11,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058365056] [2019-12-07 14:45:11,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548769626] [2019-12-07 14:45:11,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/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 14:45:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:11,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:45:11,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 14:45:12,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:45:12,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 14:45:12,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699590697] [2019-12-07 14:45:12,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:45:12,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:45:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:45:12,068 INFO L87 Difference]: Start difference. First operand 2014 states and 2877 transitions. Second operand 4 states. [2019-12-07 14:45:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:12,295 INFO L93 Difference]: Finished difference Result 4694 states and 6697 transitions. [2019-12-07 14:45:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:45:12,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-12-07 14:45:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:12,299 INFO L225 Difference]: With dead ends: 4694 [2019-12-07 14:45:12,299 INFO L226 Difference]: Without dead ends: 2643 [2019-12-07 14:45:12,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-12-07 14:45:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1989. [2019-12-07 14:45:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-12-07 14:45:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-12-07 14:45:12,346 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 372 [2019-12-07 14:45:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:12,347 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-12-07 14:45:12,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:45:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-12-07 14:45:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-12-07 14:45:12,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:12,351 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:12,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:45:12,551 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:12,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1689104854, now seen corresponding path program 1 times [2019-12-07 14:45:12,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:12,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922525559] [2019-12-07 14:45:12,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 14:45:12,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922525559] [2019-12-07 14:45:12,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421105738] [2019-12-07 14:45:12,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/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 14:45:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:12,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:45:12,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:45:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 14:45:13,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:45:13,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 14:45:13,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484784974] [2019-12-07 14:45:13,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:45:13,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:13,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:45:13,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:45:13,085 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 4 states. [2019-12-07 14:45:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:13,316 INFO L93 Difference]: Finished difference Result 4937 states and 6862 transitions. [2019-12-07 14:45:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:45:13,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-12-07 14:45:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:13,321 INFO L225 Difference]: With dead ends: 4937 [2019-12-07 14:45:13,322 INFO L226 Difference]: Without dead ends: 2814 [2019-12-07 14:45:13,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:45:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2019-12-07 14:45:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1989. [2019-12-07 14:45:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-12-07 14:45:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-12-07 14:45:13,380 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 600 [2019-12-07 14:45:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:13,380 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-12-07 14:45:13,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:45:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-12-07 14:45:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-12-07 14:45:13,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:13,385 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:13,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:45:13,586 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1687662778, now seen corresponding path program 1 times [2019-12-07 14:45:13,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:13,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329647218] [2019-12-07 14:45:13,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-12-07 14:45:13,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329647218] [2019-12-07 14:45:13,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:13,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:13,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449318816] [2019-12-07 14:45:13,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:13,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:13,871 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 3 states. [2019-12-07 14:45:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:14,000 INFO L93 Difference]: Finished difference Result 4007 states and 5539 transitions. [2019-12-07 14:45:14,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:14,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-12-07 14:45:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:14,003 INFO L225 Difference]: With dead ends: 4007 [2019-12-07 14:45:14,003 INFO L226 Difference]: Without dead ends: 2025 [2019-12-07 14:45:14,005 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 14:45:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-12-07 14:45:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1989. [2019-12-07 14:45:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-12-07 14:45:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2733 transitions. [2019-12-07 14:45:14,043 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2733 transitions. Word has length 667 [2019-12-07 14:45:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:14,043 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2733 transitions. [2019-12-07 14:45:14,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2733 transitions. [2019-12-07 14:45:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-12-07 14:45:14,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:14,048 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:14,048 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:14,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1182124796, now seen corresponding path program 1 times [2019-12-07 14:45:14,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:14,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243780424] [2019-12-07 14:45:14,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-12-07 14:45:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243780424] [2019-12-07 14:45:14,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072039563] [2019-12-07 14:45:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:14,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:14,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:14,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:14,285 INFO L87 Difference]: Start difference. First operand 1989 states and 2733 transitions. Second operand 3 states. [2019-12-07 14:45:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:14,424 INFO L93 Difference]: Finished difference Result 3986 states and 5473 transitions. [2019-12-07 14:45:14,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:14,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 681 [2019-12-07 14:45:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:14,427 INFO L225 Difference]: With dead ends: 3986 [2019-12-07 14:45:14,427 INFO L226 Difference]: Without dead ends: 2004 [2019-12-07 14:45:14,429 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 14:45:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-12-07 14:45:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1976. [2019-12-07 14:45:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-07 14:45:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2674 transitions. [2019-12-07 14:45:14,475 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2674 transitions. Word has length 681 [2019-12-07 14:45:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:14,475 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 2674 transitions. [2019-12-07 14:45:14,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2674 transitions. [2019-12-07 14:45:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-12-07 14:45:14,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:14,480 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:14,480 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:14,481 INFO L82 PathProgramCache]: Analyzing trace with hash 8635284, now seen corresponding path program 1 times [2019-12-07 14:45:14,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:14,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517877112] [2019-12-07 14:45:14,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-12-07 14:45:14,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517877112] [2019-12-07 14:45:14,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:14,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:14,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188239281] [2019-12-07 14:45:14,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:14,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:14,734 INFO L87 Difference]: Start difference. First operand 1976 states and 2674 transitions. Second operand 3 states. [2019-12-07 14:45:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:14,851 INFO L93 Difference]: Finished difference Result 4014 states and 5435 transitions. [2019-12-07 14:45:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:14,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 710 [2019-12-07 14:45:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:14,854 INFO L225 Difference]: With dead ends: 4014 [2019-12-07 14:45:14,854 INFO L226 Difference]: Without dead ends: 2027 [2019-12-07 14:45:14,855 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 14:45:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-07 14:45:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2018. [2019-12-07 14:45:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-12-07 14:45:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2719 transitions. [2019-12-07 14:45:14,892 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2719 transitions. Word has length 710 [2019-12-07 14:45:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:14,893 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 2719 transitions. [2019-12-07 14:45:14,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2719 transitions. [2019-12-07 14:45:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2019-12-07 14:45:14,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:45:14,897 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:45:14,898 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:45:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:45:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1819983258, now seen corresponding path program 1 times [2019-12-07 14:45:14,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:45:14,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835390442] [2019-12-07 14:45:14,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:45:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:45:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-12-07 14:45:15,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835390442] [2019-12-07 14:45:15,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:45:15,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:45:15,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909160139] [2019-12-07 14:45:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:45:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:45:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:45:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:45:15,225 INFO L87 Difference]: Start difference. First operand 2018 states and 2719 transitions. Second operand 3 states. [2019-12-07 14:45:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:45:15,307 INFO L93 Difference]: Finished difference Result 2591 states and 3474 transitions. [2019-12-07 14:45:15,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:45:15,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 725 [2019-12-07 14:45:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:45:15,308 INFO L225 Difference]: With dead ends: 2591 [2019-12-07 14:45:15,308 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:45:15,309 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 14:45:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:45:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:45:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:45:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:45:15,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 725 [2019-12-07 14:45:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:45:15,310 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:45:15,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:45:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:45:15,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:45:15,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:45:15,655 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-12-07 14:45:15,806 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-12-07 14:45:16,054 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-12-07 14:45:16,309 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-12-07 14:45:16,548 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-12-07 14:45:16,897 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 14:45:17,229 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-12-07 14:45:17,497 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-12-07 14:45:17,681 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-12-07 14:45:17,834 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-12-07 14:45:18,069 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 14:45:18,303 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 14:45:18,528 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 14:45:18,760 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 14:45:19,034 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 14:45:19,287 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-12-07 14:45:19,706 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-12-07 14:45:19,965 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-12-07 14:45:20,230 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-12-07 14:45:20,453 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-12-07 14:45:20,698 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 14:45:21,098 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-12-07 14:45:21,100 INFO L246 CegarLoopResult]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-12-07 14:45:21,101 INFO L246 CegarLoopResult]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-12-07 14:45:21,101 INFO L246 CegarLoopResult]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-12-07 14:45:21,101 INFO L246 CegarLoopResult]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-12-07 14:45:21,101 INFO L242 CegarLoopResult]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-12-07 14:45:21,101 INFO L242 CegarLoopResult]: At program point L103(lines 102 628) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-12-07 14:45:21,101 INFO L246 CegarLoopResult]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-12-07 14:45:21,101 INFO L246 CegarLoopResult]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L242 CegarLoopResult]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 14:45:21,102 INFO L242 CegarLoopResult]: At program point L172(lines 168 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse7 .cse10 .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-12-07 14:45:21,102 INFO L242 CegarLoopResult]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 14:45:21,102 INFO L246 CegarLoopResult]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L242 CegarLoopResult]: At program point L404(lines 395 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L242 CegarLoopResult]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-12-07 14:45:21,103 INFO L246 CegarLoopResult]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-12-07 14:45:21,104 INFO L246 CegarLoopResult]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-12-07 14:45:21,104 INFO L246 CegarLoopResult]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-12-07 14:45:21,104 INFO L246 CegarLoopResult]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-12-07 14:45:21,104 INFO L246 CegarLoopResult]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-12-07 14:45:21,104 INFO L242 CegarLoopResult]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,104 INFO L242 CegarLoopResult]: At program point L145(lines 141 615) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,104 INFO L246 CegarLoopResult]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-12-07 14:45:21,104 INFO L242 CegarLoopResult]: At program point L212(lines 105 627) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-12-07 14:45:21,104 INFO L249 CegarLoopResult]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-12-07 14:45:21,104 INFO L246 CegarLoopResult]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L249 CegarLoopResult]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-12-07 14:45:21,105 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L242 CegarLoopResult]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,106 INFO L242 CegarLoopResult]: At program point L151(lines 147 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-12-07 14:45:21,106 INFO L246 CegarLoopResult]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L242 CegarLoopResult]: At program point L121(lines 117 623) the Hoare annotation is: (let ((.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse11 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse12 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse15 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L242 CegarLoopResult]: At program point L553(lines 65 677) the Hoare annotation is: false [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:45:21,107 INFO L242 CegarLoopResult]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21))) [2019-12-07 14:45:21,108 INFO L242 CegarLoopResult]: At program point L157(lines 153 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,108 INFO L242 CegarLoopResult]: At program point L124(lines 123 621) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L249 CegarLoopResult]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L242 CegarLoopResult]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-12-07 14:45:21,108 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L242 CegarLoopResult]: At program point L360(lines 342 378) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L242 CegarLoopResult]: At program point L394(lines 385 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,109 INFO L246 CegarLoopResult]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-12-07 14:45:21,109 INFO L242 CegarLoopResult]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,110 INFO L242 CegarLoopResult]: At program point L163(lines 159 609) the Hoare annotation is: (let ((.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse11 .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse13 .cse8 .cse14 .cse9 .cse15 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse16))) [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 671) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L249 CegarLoopResult]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L246 CegarLoopResult]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-12-07 14:45:21,110 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-12-07 14:45:21,110 INFO L242 CegarLoopResult]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 .cse11 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-12-07 14:45:21,111 INFO L242 CegarLoopResult]: At program point L133(lines 126 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12 (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)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 14:45:21,111 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 14:45:21,111 INFO L246 CegarLoopResult]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-12-07 14:45:21,111 INFO L246 CegarLoopResult]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-12-07 14:45:21,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:45:21 BoogieIcfgContainer [2019-12-07 14:45:21,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:45:21,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:45:21,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:45:21,143 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:45:21,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:45:05" (3/4) ... [2019-12-07 14:45:21,146 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:45:21,158 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 14:45:21,159 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:45:21,227 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_33d0eda3-db6c-440c-bd14-ab492db0a078/bin/uautomizer/witness.graphml [2019-12-07 14:45:21,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:45:21,228 INFO L168 Benchmark]: Toolchain (without parser) took 16206.80 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 961.0 MB). Free memory was 945.1 MB in the beginning and 1.7 GB in the end (delta: -728.1 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:21,229 INFO L168 Benchmark]: CDTParser took 0.18 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 14:45:21,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:21,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.48 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 14:45:21,229 INFO L168 Benchmark]: Boogie Preprocessor took 24.57 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 14:45:21,229 INFO L168 Benchmark]: RCFGBuilder took 409.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:21,230 INFO L168 Benchmark]: TraceAbstraction took 15393.25 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 867.7 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -681.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:45:21,230 INFO L168 Benchmark]: Witness Printer took 84.26 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:45:21,231 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.48 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.57 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 409.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15393.25 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 867.7 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -681.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 84.26 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 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) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((!(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__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 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)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 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) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 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) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((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 == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 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 == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 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)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((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) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 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)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 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 == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 1 error locations. Result: SAFE, OverallTime: 9.5s, OverallIterations: 37, TraceHistogramMax: 25, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, HoareTripleCheckerStatistics: 5821 SDtfs, 4958 SDslu, 2005 SDs, 0 SdLazy, 3403 SolverSat, 1378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 227 NumberOfFragments, 3549 HoareAnnotationTreeSize, 29 FomulaSimplifications, 33715 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7568 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 9471 NumberOfCodeBlocks, 9471 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9431 ConstructedInterpolants, 0 QuantifiedInterpolants, 4588760 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 40 InterpolantComputations, 35 PerfectInterpolantSequences, 40583/40713 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...