./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/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_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49452e318e3c9c4b1e038ab7778998d33b04e5b2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:45:23,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:23,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:23,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:23,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:23,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:23,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:23,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:23,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:23,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:23,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:23,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:23,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:23,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:23,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:23,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:23,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:23,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:23,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:23,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:23,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:23,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:23,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:23,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:23,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:23,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:23,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:23,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:23,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:23,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:23,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:23,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:23,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:23,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:23,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:23,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:23,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:23,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:23,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:23,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:23,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:23,172 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:45:23,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:23,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:23,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,185 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:23,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:23,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:23,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:23,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:23,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:23,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:23,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:23,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:23,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:23,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:23,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:23,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:45:23,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:23,190 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_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-25 08:45:23,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,336 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,337 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-25 08:45:23,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/data/3b67d8be9/bffe61735a70407992e351c839c3da1c/FLAG28c726d25 [2019-11-25 08:45:23,860 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:23,861 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-25 08:45:23,879 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/data/3b67d8be9/bffe61735a70407992e351c839c3da1c/FLAG28c726d25 [2019-11-25 08:45:23,894 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/data/3b67d8be9/bffe61735a70407992e351c839c3da1c [2019-11-25 08:45:23,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:23,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:23,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:23,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:23,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:23,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:23" (1/1) ... [2019-11-25 08:45:23,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6400364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:23, skipping insertion in model container [2019-11-25 08:45:23,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:23" (1/1) ... [2019-11-25 08:45:23,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:23,971 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:24,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,276 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:24,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,374 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:24,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24 WrapperNode [2019-11-25 08:45:24,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:24,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:24,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:24,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:24,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:24,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:24,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:24,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:24,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:24,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:24,727 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:45:25,391 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:45:25,391 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:45:25,392 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:25,393 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:45:25,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25 BoogieIcfgContainer [2019-11-25 08:45:25,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:25,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:45:25,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:45:25,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:45:25,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:45:23" (1/3) ... [2019-11-25 08:45:25,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b50d97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (2/3) ... [2019-11-25 08:45:25,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b50d97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/3) ... [2019-11-25 08:45:25,400 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-25 08:45:25,408 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:45:25,415 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:45:25,422 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:45:25,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:45:25,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:45:25,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:45:25,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:25,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:25,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:45:25,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:25,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:45:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-25 08:45:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:45:25,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,474 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-11-25 08:45:25,474 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash -91611738, now seen corresponding path program 1 times [2019-11-25 08:45:25,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466865563] [2019-11-25 08:45:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:25,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466865563] [2019-11-25 08:45:25,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:25,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:25,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58920586] [2019-11-25 08:45:25,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:25,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:25,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:25,722 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-11-25 08:45:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,072 INFO L93 Difference]: Finished difference Result 327 states and 564 transitions. [2019-11-25 08:45:26,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-25 08:45:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,086 INFO L225 Difference]: With dead ends: 327 [2019-11-25 08:45:26,086 INFO L226 Difference]: Without dead ends: 173 [2019-11-25 08:45:26,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-25 08:45:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2019-11-25 08:45:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-25 08:45:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 273 transitions. [2019-11-25 08:45:26,141 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 273 transitions. Word has length 43 [2019-11-25 08:45:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,141 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 273 transitions. [2019-11-25 08:45:26,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 273 transitions. [2019-11-25 08:45:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:45:26,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,144 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-11-25 08:45:26,144 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1448027309, now seen corresponding path program 1 times [2019-11-25 08:45:26,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420767488] [2019-11-25 08:45:26,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420767488] [2019-11-25 08:45:26,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811737977] [2019-11-25 08:45:26,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,228 INFO L87 Difference]: Start difference. First operand 167 states and 273 transitions. Second operand 3 states. [2019-11-25 08:45:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,510 INFO L93 Difference]: Finished difference Result 376 states and 623 transitions. [2019-11-25 08:45:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:45:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,514 INFO L225 Difference]: With dead ends: 376 [2019-11-25 08:45:26,514 INFO L226 Difference]: Without dead ends: 214 [2019-11-25 08:45:26,516 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-11-25 08:45:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-25 08:45:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-11-25 08:45:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-25 08:45:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 350 transitions. [2019-11-25 08:45:26,555 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 350 transitions. Word has length 44 [2019-11-25 08:45:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,556 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 350 transitions. [2019-11-25 08:45:26,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 350 transitions. [2019-11-25 08:45:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:45:26,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,566 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-11-25 08:45:26,566 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1909160843, now seen corresponding path program 1 times [2019-11-25 08:45:26,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054329553] [2019-11-25 08:45:26,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054329553] [2019-11-25 08:45:26,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388455033] [2019-11-25 08:45:26,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,676 INFO L87 Difference]: Start difference. First operand 208 states and 350 transitions. Second operand 3 states. [2019-11-25 08:45:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,880 INFO L93 Difference]: Finished difference Result 440 states and 747 transitions. [2019-11-25 08:45:26,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-25 08:45:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,883 INFO L225 Difference]: With dead ends: 440 [2019-11-25 08:45:26,883 INFO L226 Difference]: Without dead ends: 239 [2019-11-25 08:45:26,885 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-11-25 08:45:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-25 08:45:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-11-25 08:45:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-25 08:45:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 406 transitions. [2019-11-25 08:45:26,907 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 406 transitions. Word has length 72 [2019-11-25 08:45:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,908 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 406 transitions. [2019-11-25 08:45:26,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 406 transitions. [2019-11-25 08:45:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:45:26,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,911 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-11-25 08:45:26,911 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1091248829, now seen corresponding path program 1 times [2019-11-25 08:45:26,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664335024] [2019-11-25 08:45:26,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664335024] [2019-11-25 08:45:26,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299995005] [2019-11-25 08:45:26,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,992 INFO L87 Difference]: Start difference. First operand 239 states and 406 transitions. Second operand 3 states. [2019-11-25 08:45:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,218 INFO L93 Difference]: Finished difference Result 517 states and 883 transitions. [2019-11-25 08:45:27,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:45:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,222 INFO L225 Difference]: With dead ends: 517 [2019-11-25 08:45:27,222 INFO L226 Difference]: Without dead ends: 285 [2019-11-25 08:45:27,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-11-25 08:45:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-25 08:45:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-25 08:45:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-25 08:45:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 481 transitions. [2019-11-25 08:45:27,245 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 481 transitions. Word has length 83 [2019-11-25 08:45:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,246 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 481 transitions. [2019-11-25 08:45:27,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 481 transitions. [2019-11-25 08:45:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:45:27,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,248 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-11-25 08:45:27,248 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash 448380383, now seen corresponding path program 1 times [2019-11-25 08:45:27,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682409416] [2019-11-25 08:45:27,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:27,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682409416] [2019-11-25 08:45:27,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153652198] [2019-11-25 08:45:27,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,314 INFO L87 Difference]: Start difference. First operand 281 states and 481 transitions. Second operand 3 states. [2019-11-25 08:45:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,476 INFO L93 Difference]: Finished difference Result 572 states and 979 transitions. [2019-11-25 08:45:27,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:45:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,479 INFO L225 Difference]: With dead ends: 572 [2019-11-25 08:45:27,479 INFO L226 Difference]: Without dead ends: 298 [2019-11-25 08:45:27,480 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-11-25 08:45:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-25 08:45:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-25 08:45:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-25 08:45:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 503 transitions. [2019-11-25 08:45:27,498 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 503 transitions. Word has length 84 [2019-11-25 08:45:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,499 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 503 transitions. [2019-11-25 08:45:27,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 503 transitions. [2019-11-25 08:45:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:45:27,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,501 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-11-25 08:45:27,501 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash 429685604, now seen corresponding path program 1 times [2019-11-25 08:45:27,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441694123] [2019-11-25 08:45:27,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441694123] [2019-11-25 08:45:27,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543297089] [2019-11-25 08:45:27,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,573 INFO L87 Difference]: Start difference. First operand 296 states and 503 transitions. Second operand 3 states. [2019-11-25 08:45:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,772 INFO L93 Difference]: Finished difference Result 589 states and 1000 transitions. [2019-11-25 08:45:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:45:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,775 INFO L225 Difference]: With dead ends: 589 [2019-11-25 08:45:27,775 INFO L226 Difference]: Without dead ends: 298 [2019-11-25 08:45:27,776 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-11-25 08:45:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-25 08:45:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-25 08:45:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-25 08:45:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-11-25 08:45:27,788 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-11-25 08:45:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,788 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-11-25 08:45:27,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-11-25 08:45:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:45:27,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,790 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-11-25 08:45:27,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash -52731309, now seen corresponding path program 1 times [2019-11-25 08:45:27,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630683548] [2019-11-25 08:45:27,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:27,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630683548] [2019-11-25 08:45:27,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021090630] [2019-11-25 08:45:27,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,827 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 3 states. [2019-11-25 08:45:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,977 INFO L93 Difference]: Finished difference Result 583 states and 987 transitions. [2019-11-25 08:45:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:45:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,979 INFO L225 Difference]: With dead ends: 583 [2019-11-25 08:45:27,979 INFO L226 Difference]: Without dead ends: 296 [2019-11-25 08:45:27,980 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-11-25 08:45:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-25 08:45:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-25 08:45:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-25 08:45:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 494 transitions. [2019-11-25 08:45:27,991 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 494 transitions. Word has length 85 [2019-11-25 08:45:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,991 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 494 transitions. [2019-11-25 08:45:27,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 494 transitions. [2019-11-25 08:45:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:45:27,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,993 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-11-25 08:45:27,993 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -825774373, now seen corresponding path program 1 times [2019-11-25 08:45:27,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107471437] [2019-11-25 08:45:27,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-25 08:45:28,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107471437] [2019-11-25 08:45:28,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114930247] [2019-11-25 08:45:28,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,032 INFO L87 Difference]: Start difference. First operand 294 states and 494 transitions. Second operand 3 states. [2019-11-25 08:45:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,148 INFO L93 Difference]: Finished difference Result 589 states and 988 transitions. [2019-11-25 08:45:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-25 08:45:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,151 INFO L225 Difference]: With dead ends: 589 [2019-11-25 08:45:28,151 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:45:28,152 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-11-25 08:45:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:45:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-11-25 08:45:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-25 08:45:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 499 transitions. [2019-11-25 08:45:28,163 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 499 transitions. Word has length 97 [2019-11-25 08:45:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,164 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 499 transitions. [2019-11-25 08:45:28,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 499 transitions. [2019-11-25 08:45:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:45:28,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,166 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-11-25 08:45:28,166 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1871019140, now seen corresponding path program 1 times [2019-11-25 08:45:28,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206789885] [2019-11-25 08:45:28,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206789885] [2019-11-25 08:45:28,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121415934] [2019-11-25 08:45:28,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,205 INFO L87 Difference]: Start difference. First operand 302 states and 499 transitions. Second operand 3 states. [2019-11-25 08:45:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,355 INFO L93 Difference]: Finished difference Result 628 states and 1040 transitions. [2019-11-25 08:45:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:45:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,358 INFO L225 Difference]: With dead ends: 628 [2019-11-25 08:45:28,358 INFO L226 Difference]: Without dead ends: 333 [2019-11-25 08:45:28,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-11-25 08:45:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-25 08:45:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-11-25 08:45:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-25 08:45:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 546 transitions. [2019-11-25 08:45:28,373 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 546 transitions. Word has length 98 [2019-11-25 08:45:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,373 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 546 transitions. [2019-11-25 08:45:28,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 546 transitions. [2019-11-25 08:45:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:45:28,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,375 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-11-25 08:45:28,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1449457736, now seen corresponding path program 1 times [2019-11-25 08:45:28,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264373307] [2019-11-25 08:45:28,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264373307] [2019-11-25 08:45:28,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725965344] [2019-11-25 08:45:28,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,442 INFO L87 Difference]: Start difference. First operand 331 states and 546 transitions. Second operand 3 states. [2019-11-25 08:45:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,595 INFO L93 Difference]: Finished difference Result 689 states and 1140 transitions. [2019-11-25 08:45:28,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:45:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,598 INFO L225 Difference]: With dead ends: 689 [2019-11-25 08:45:28,598 INFO L226 Difference]: Without dead ends: 365 [2019-11-25 08:45:28,598 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-11-25 08:45:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-25 08:45:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-25 08:45:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-25 08:45:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 588 transitions. [2019-11-25 08:45:28,620 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 588 transitions. Word has length 99 [2019-11-25 08:45:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,621 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 588 transitions. [2019-11-25 08:45:28,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 588 transitions. [2019-11-25 08:45:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:45:28,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,623 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-11-25 08:45:28,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1215142768, now seen corresponding path program 1 times [2019-11-25 08:45:28,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441751994] [2019-11-25 08:45:28,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441751994] [2019-11-25 08:45:28,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190166318] [2019-11-25 08:45:28,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,665 INFO L87 Difference]: Start difference. First operand 358 states and 588 transitions. Second operand 3 states. [2019-11-25 08:45:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,832 INFO L93 Difference]: Finished difference Result 711 states and 1167 transitions. [2019-11-25 08:45:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:45:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,835 INFO L225 Difference]: With dead ends: 711 [2019-11-25 08:45:28,835 INFO L226 Difference]: Without dead ends: 360 [2019-11-25 08:45:28,836 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-11-25 08:45:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-25 08:45:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2019-11-25 08:45:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-25 08:45:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 584 transitions. [2019-11-25 08:45:28,849 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 584 transitions. Word has length 99 [2019-11-25 08:45:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,849 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 584 transitions. [2019-11-25 08:45:28,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 584 transitions. [2019-11-25 08:45:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:45:28,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,851 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-11-25 08:45:28,852 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash -32577404, now seen corresponding path program 1 times [2019-11-25 08:45:28,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481856188] [2019-11-25 08:45:28,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:45:28,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481856188] [2019-11-25 08:45:28,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254631350] [2019-11-25 08:45:28,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,882 INFO L87 Difference]: Start difference. First operand 358 states and 584 transitions. Second operand 3 states. [2019-11-25 08:45:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,032 INFO L93 Difference]: Finished difference Result 716 states and 1169 transitions. [2019-11-25 08:45:29,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:45:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,035 INFO L225 Difference]: With dead ends: 716 [2019-11-25 08:45:29,035 INFO L226 Difference]: Without dead ends: 365 [2019-11-25 08:45:29,036 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-11-25 08:45:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-25 08:45:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-25 08:45:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-25 08:45:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 579 transitions. [2019-11-25 08:45:29,050 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 579 transitions. Word has length 100 [2019-11-25 08:45:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,050 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 579 transitions. [2019-11-25 08:45:29,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 579 transitions. [2019-11-25 08:45:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:45:29,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,052 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-11-25 08:45:29,052 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1057958359, now seen corresponding path program 1 times [2019-11-25 08:45:29,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399872474] [2019-11-25 08:45:29,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399872474] [2019-11-25 08:45:29,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934552066] [2019-11-25 08:45:29,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,085 INFO L87 Difference]: Start difference. First operand 358 states and 579 transitions. Second operand 3 states. [2019-11-25 08:45:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,239 INFO L93 Difference]: Finished difference Result 734 states and 1188 transitions. [2019-11-25 08:45:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:45:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,242 INFO L225 Difference]: With dead ends: 734 [2019-11-25 08:45:29,242 INFO L226 Difference]: Without dead ends: 383 [2019-11-25 08:45:29,243 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-11-25 08:45:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-25 08:45:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-25 08:45:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-25 08:45:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 608 transitions. [2019-11-25 08:45:29,260 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 608 transitions. Word has length 104 [2019-11-25 08:45:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,261 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 608 transitions. [2019-11-25 08:45:29,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2019-11-25 08:45:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:45:29,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,263 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-11-25 08:45:29,263 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash -278357315, now seen corresponding path program 1 times [2019-11-25 08:45:29,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268528255] [2019-11-25 08:45:29,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268528255] [2019-11-25 08:45:29,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336337428] [2019-11-25 08:45:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,302 INFO L87 Difference]: Start difference. First operand 379 states and 608 transitions. Second operand 3 states. [2019-11-25 08:45:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,475 INFO L93 Difference]: Finished difference Result 755 states and 1211 transitions. [2019-11-25 08:45:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:45:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,478 INFO L225 Difference]: With dead ends: 755 [2019-11-25 08:45:29,478 INFO L226 Difference]: Without dead ends: 383 [2019-11-25 08:45:29,479 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-11-25 08:45:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-25 08:45:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-25 08:45:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-25 08:45:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2019-11-25 08:45:29,493 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 105 [2019-11-25 08:45:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,493 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2019-11-25 08:45:29,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2019-11-25 08:45:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-25 08:45:29,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,495 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-11-25 08:45:29,496 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash 138382894, now seen corresponding path program 1 times [2019-11-25 08:45:29,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862001298] [2019-11-25 08:45:29,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862001298] [2019-11-25 08:45:29,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:29,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132495549] [2019-11-25 08:45:29,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,529 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand 3 states. [2019-11-25 08:45:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,579 INFO L93 Difference]: Finished difference Result 1117 states and 1778 transitions. [2019-11-25 08:45:29,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-25 08:45:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,583 INFO L225 Difference]: With dead ends: 1117 [2019-11-25 08:45:29,583 INFO L226 Difference]: Without dead ends: 745 [2019-11-25 08:45:29,584 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-11-25 08:45:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-25 08:45:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-25 08:45:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-25 08:45:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1181 transitions. [2019-11-25 08:45:29,611 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1181 transitions. Word has length 120 [2019-11-25 08:45:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,612 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1181 transitions. [2019-11-25 08:45:29,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1181 transitions. [2019-11-25 08:45:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-25 08:45:29,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,614 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-11-25 08:45:29,615 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2017513840, now seen corresponding path program 1 times [2019-11-25 08:45:29,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98495776] [2019-11-25 08:45:29,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:45:29,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98495776] [2019-11-25 08:45:29,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:29,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310291116] [2019-11-25 08:45:29,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,658 INFO L87 Difference]: Start difference. First operand 745 states and 1181 transitions. Second operand 3 states. [2019-11-25 08:45:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,713 INFO L93 Difference]: Finished difference Result 1117 states and 1772 transitions. [2019-11-25 08:45:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-25 08:45:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,719 INFO L225 Difference]: With dead ends: 1117 [2019-11-25 08:45:29,719 INFO L226 Difference]: Without dead ends: 1115 [2019-11-25 08:45:29,720 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-11-25 08:45:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-11-25 08:45:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2019-11-25 08:45:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-25 08:45:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1769 transitions. [2019-11-25 08:45:29,762 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1769 transitions. Word has length 120 [2019-11-25 08:45:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,762 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1769 transitions. [2019-11-25 08:45:29,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1769 transitions. [2019-11-25 08:45:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:45:29,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,765 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-11-25 08:45:29,766 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,766 INFO L82 PathProgramCache]: Analyzing trace with hash -888705079, now seen corresponding path program 1 times [2019-11-25 08:45:29,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071493147] [2019-11-25 08:45:29,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:29,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071493147] [2019-11-25 08:45:29,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421944464] [2019-11-25 08:45:29,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,802 INFO L87 Difference]: Start difference. First operand 1115 states and 1769 transitions. Second operand 3 states. [2019-11-25 08:45:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,011 INFO L93 Difference]: Finished difference Result 2349 states and 3730 transitions. [2019-11-25 08:45:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:45:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,019 INFO L225 Difference]: With dead ends: 2349 [2019-11-25 08:45:30,019 INFO L226 Difference]: Without dead ends: 1241 [2019-11-25 08:45:30,021 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-11-25 08:45:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-25 08:45:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1229. [2019-11-25 08:45:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-11-25 08:45:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1946 transitions. [2019-11-25 08:45:30,066 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1946 transitions. Word has length 121 [2019-11-25 08:45:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,067 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 1946 transitions. [2019-11-25 08:45:30,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1946 transitions. [2019-11-25 08:45:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 08:45:30,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,070 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-11-25 08:45:30,070 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 601692112, now seen corresponding path program 1 times [2019-11-25 08:45:30,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116186167] [2019-11-25 08:45:30,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:45:30,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116186167] [2019-11-25 08:45:30,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822710521] [2019-11-25 08:45:30,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,107 INFO L87 Difference]: Start difference. First operand 1229 states and 1946 transitions. Second operand 3 states. [2019-11-25 08:45:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,296 INFO L93 Difference]: Finished difference Result 2463 states and 3898 transitions. [2019-11-25 08:45:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-25 08:45:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,303 INFO L225 Difference]: With dead ends: 2463 [2019-11-25 08:45:30,303 INFO L226 Difference]: Without dead ends: 1235 [2019-11-25 08:45:30,305 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-11-25 08:45:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-25 08:45:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-25 08:45:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-25 08:45:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1928 transitions. [2019-11-25 08:45:30,353 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1928 transitions. Word has length 122 [2019-11-25 08:45:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,354 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1928 transitions. [2019-11-25 08:45:30,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1928 transitions. [2019-11-25 08:45:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-25 08:45:30,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,357 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-11-25 08:45:30,358 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1105504061, now seen corresponding path program 1 times [2019-11-25 08:45:30,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109441194] [2019-11-25 08:45:30,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-25 08:45:30,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109441194] [2019-11-25 08:45:30,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891250197] [2019-11-25 08:45:30,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,415 INFO L87 Difference]: Start difference. First operand 1223 states and 1928 transitions. Second operand 3 states. [2019-11-25 08:45:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,638 INFO L93 Difference]: Finished difference Result 2553 states and 4025 transitions. [2019-11-25 08:45:30,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-25 08:45:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,647 INFO L225 Difference]: With dead ends: 2553 [2019-11-25 08:45:30,647 INFO L226 Difference]: Without dead ends: 1337 [2019-11-25 08:45:30,649 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-11-25 08:45:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-25 08:45:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-11-25 08:45:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-11-25 08:45:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2090 transitions. [2019-11-25 08:45:30,705 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2090 transitions. Word has length 154 [2019-11-25 08:45:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,705 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 2090 transitions. [2019-11-25 08:45:30,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2090 transitions. [2019-11-25 08:45:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-25 08:45:30,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,710 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-11-25 08:45:30,710 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2116162422, now seen corresponding path program 1 times [2019-11-25 08:45:30,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285708636] [2019-11-25 08:45:30,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-25 08:45:30,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285708636] [2019-11-25 08:45:30,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803972474] [2019-11-25 08:45:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,776 INFO L87 Difference]: Start difference. First operand 1331 states and 2090 transitions. Second operand 3 states. [2019-11-25 08:45:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,017 INFO L93 Difference]: Finished difference Result 2661 states and 4175 transitions. [2019-11-25 08:45:31,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-25 08:45:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,046 INFO L225 Difference]: With dead ends: 2661 [2019-11-25 08:45:31,046 INFO L226 Difference]: Without dead ends: 1331 [2019-11-25 08:45:31,048 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-11-25 08:45:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-11-25 08:45:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1325. [2019-11-25 08:45:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-11-25 08:45:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2069 transitions. [2019-11-25 08:45:31,099 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2069 transitions. Word has length 155 [2019-11-25 08:45:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,100 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 2069 transitions. [2019-11-25 08:45:31,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2069 transitions. [2019-11-25 08:45:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-25 08:45:31,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,104 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-11-25 08:45:31,105 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash 926552750, now seen corresponding path program 1 times [2019-11-25 08:45:31,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213206823] [2019-11-25 08:45:31,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-25 08:45:31,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213206823] [2019-11-25 08:45:31,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998047837] [2019-11-25 08:45:31,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,156 INFO L87 Difference]: Start difference. First operand 1325 states and 2069 transitions. Second operand 3 states. [2019-11-25 08:45:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,366 INFO L93 Difference]: Finished difference Result 2751 states and 4295 transitions. [2019-11-25 08:45:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-25 08:45:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,375 INFO L225 Difference]: With dead ends: 2751 [2019-11-25 08:45:31,375 INFO L226 Difference]: Without dead ends: 1433 [2019-11-25 08:45:31,377 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-11-25 08:45:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-11-25 08:45:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1427. [2019-11-25 08:45:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-11-25 08:45:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2216 transitions. [2019-11-25 08:45:31,430 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2216 transitions. Word has length 185 [2019-11-25 08:45:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,430 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 2216 transitions. [2019-11-25 08:45:31,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2216 transitions. [2019-11-25 08:45:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-25 08:45:31,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,435 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-11-25 08:45:31,435 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 405410805, now seen corresponding path program 1 times [2019-11-25 08:45:31,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198474824] [2019-11-25 08:45:31,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-25 08:45:31,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198474824] [2019-11-25 08:45:31,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14824125] [2019-11-25 08:45:31,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,487 INFO L87 Difference]: Start difference. First operand 1427 states and 2216 transitions. Second operand 3 states. [2019-11-25 08:45:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,678 INFO L93 Difference]: Finished difference Result 2853 states and 4427 transitions. [2019-11-25 08:45:31,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-25 08:45:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,687 INFO L225 Difference]: With dead ends: 2853 [2019-11-25 08:45:31,687 INFO L226 Difference]: Without dead ends: 1427 [2019-11-25 08:45:31,689 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-11-25 08:45:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-25 08:45:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1421. [2019-11-25 08:45:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-11-25 08:45:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2192 transitions. [2019-11-25 08:45:31,742 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2192 transitions. Word has length 186 [2019-11-25 08:45:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,742 INFO L462 AbstractCegarLoop]: Abstraction has 1421 states and 2192 transitions. [2019-11-25 08:45:31,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2192 transitions. [2019-11-25 08:45:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-25 08:45:31,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,747 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-11-25 08:45:31,747 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash 311594383, now seen corresponding path program 1 times [2019-11-25 08:45:31,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625711532] [2019-11-25 08:45:31,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-25 08:45:31,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625711532] [2019-11-25 08:45:31,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591513334] [2019-11-25 08:45:31,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,811 INFO L87 Difference]: Start difference. First operand 1421 states and 2192 transitions. Second operand 3 states. [2019-11-25 08:45:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,988 INFO L93 Difference]: Finished difference Result 2946 states and 4556 transitions. [2019-11-25 08:45:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-25 08:45:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,997 INFO L225 Difference]: With dead ends: 2946 [2019-11-25 08:45:31,998 INFO L226 Difference]: Without dead ends: 1532 [2019-11-25 08:45:32,000 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-11-25 08:45:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-25 08:45:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-25 08:45:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-25 08:45:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2288 transitions. [2019-11-25 08:45:32,054 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2288 transitions. Word has length 203 [2019-11-25 08:45:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,054 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2288 transitions. [2019-11-25 08:45:32,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2288 transitions. [2019-11-25 08:45:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-25 08:45:32,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,059 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-11-25 08:45:32,059 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1374927291, now seen corresponding path program 1 times [2019-11-25 08:45:32,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216045249] [2019-11-25 08:45:32,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-25 08:45:32,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216045249] [2019-11-25 08:45:32,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119718583] [2019-11-25 08:45:32,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,114 INFO L87 Difference]: Start difference. First operand 1496 states and 2288 transitions. Second operand 3 states. [2019-11-25 08:45:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,303 INFO L93 Difference]: Finished difference Result 3021 states and 4625 transitions. [2019-11-25 08:45:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-25 08:45:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,312 INFO L225 Difference]: With dead ends: 3021 [2019-11-25 08:45:32,312 INFO L226 Difference]: Without dead ends: 1532 [2019-11-25 08:45:32,315 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-11-25 08:45:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-25 08:45:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-25 08:45:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-25 08:45:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2261 transitions. [2019-11-25 08:45:32,383 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2261 transitions. Word has length 204 [2019-11-25 08:45:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,384 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2261 transitions. [2019-11-25 08:45:32,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2261 transitions. [2019-11-25 08:45:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-25 08:45:32,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,388 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-11-25 08:45:32,389 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1705472573, now seen corresponding path program 1 times [2019-11-25 08:45:32,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834944919] [2019-11-25 08:45:32,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-25 08:45:32,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834944919] [2019-11-25 08:45:32,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809320315] [2019-11-25 08:45:32,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,443 INFO L87 Difference]: Start difference. First operand 1496 states and 2261 transitions. Second operand 3 states. [2019-11-25 08:45:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,626 INFO L93 Difference]: Finished difference Result 2997 states and 4526 transitions. [2019-11-25 08:45:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-25 08:45:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,635 INFO L225 Difference]: With dead ends: 2997 [2019-11-25 08:45:32,635 INFO L226 Difference]: Without dead ends: 1508 [2019-11-25 08:45:32,637 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-11-25 08:45:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-11-25 08:45:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1496. [2019-11-25 08:45:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-25 08:45:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-11-25 08:45:32,684 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 216 [2019-11-25 08:45:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,685 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-11-25 08:45:32,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-11-25 08:45:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-25 08:45:32,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,690 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-11-25 08:45:32,690 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2105710730, now seen corresponding path program 1 times [2019-11-25 08:45:32,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582330877] [2019-11-25 08:45:32,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-25 08:45:32,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582330877] [2019-11-25 08:45:32,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581825654] [2019-11-25 08:45:32,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,748 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-11-25 08:45:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,948 INFO L93 Difference]: Finished difference Result 2997 states and 4490 transitions. [2019-11-25 08:45:32,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-25 08:45:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,957 INFO L225 Difference]: With dead ends: 2997 [2019-11-25 08:45:32,957 INFO L226 Difference]: Without dead ends: 1481 [2019-11-25 08:45:32,959 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-11-25 08:45:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-25 08:45:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1469. [2019-11-25 08:45:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-11-25 08:45:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2186 transitions. [2019-11-25 08:45:33,005 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2186 transitions. Word has length 217 [2019-11-25 08:45:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,006 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 2186 transitions. [2019-11-25 08:45:33,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2186 transitions. [2019-11-25 08:45:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-25 08:45:33,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,010 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-11-25 08:45:33,011 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash 721369725, now seen corresponding path program 1 times [2019-11-25 08:45:33,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747114438] [2019-11-25 08:45:33,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-25 08:45:33,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747114438] [2019-11-25 08:45:33,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:33,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657732916] [2019-11-25 08:45:33,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,065 INFO L87 Difference]: Start difference. First operand 1469 states and 2186 transitions. Second operand 3 states. [2019-11-25 08:45:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,238 INFO L93 Difference]: Finished difference Result 2986 states and 4447 transitions. [2019-11-25 08:45:33,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-25 08:45:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,247 INFO L225 Difference]: With dead ends: 2986 [2019-11-25 08:45:33,247 INFO L226 Difference]: Without dead ends: 1524 [2019-11-25 08:45:33,249 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-11-25 08:45:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2019-11-25 08:45:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1515. [2019-11-25 08:45:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-25 08:45:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2230 transitions. [2019-11-25 08:45:33,297 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2230 transitions. Word has length 223 [2019-11-25 08:45:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,297 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2230 transitions. [2019-11-25 08:45:33,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2230 transitions. [2019-11-25 08:45:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-25 08:45:33,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,302 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-11-25 08:45:33,302 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 194394121, now seen corresponding path program 1 times [2019-11-25 08:45:33,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827117538] [2019-11-25 08:45:33,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-25 08:45:33,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827117538] [2019-11-25 08:45:33,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:33,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840976338] [2019-11-25 08:45:33,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,358 INFO L87 Difference]: Start difference. First operand 1515 states and 2230 transitions. Second operand 3 states. [2019-11-25 08:45:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,532 INFO L93 Difference]: Finished difference Result 2605 states and 3838 transitions. [2019-11-25 08:45:33,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-25 08:45:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,538 INFO L225 Difference]: With dead ends: 2605 [2019-11-25 08:45:33,539 INFO L226 Difference]: Without dead ends: 1085 [2019-11-25 08:45:33,541 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-11-25 08:45:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-25 08:45:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1079. [2019-11-25 08:45:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-25 08:45:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1573 transitions. [2019-11-25 08:45:33,582 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1573 transitions. Word has length 224 [2019-11-25 08:45:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,582 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1573 transitions. [2019-11-25 08:45:33,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1573 transitions. [2019-11-25 08:45:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-25 08:45:33,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,588 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-11-25 08:45:33,588 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1786104814, now seen corresponding path program 1 times [2019-11-25 08:45:33,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405881058] [2019-11-25 08:45:33,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-25 08:45:33,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405881058] [2019-11-25 08:45:33,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605682906] [2019-11-25 08:45:33,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:45:33,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-25 08:45:33,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:45:33,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:45:33,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142190381] [2019-11-25 08:45:33,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:33,981 INFO L87 Difference]: Start difference. First operand 1079 states and 1573 transitions. Second operand 3 states. [2019-11-25 08:45:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,055 INFO L93 Difference]: Finished difference Result 2658 states and 3873 transitions. [2019-11-25 08:45:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-25 08:45:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,076 INFO L225 Difference]: With dead ends: 2658 [2019-11-25 08:45:34,082 INFO L226 Difference]: Without dead ends: 1586 [2019-11-25 08:45:34,084 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-11-25 08:45:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-11-25 08:45:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2019-11-25 08:45:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-25 08:45:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2310 transitions. [2019-11-25 08:45:34,154 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2310 transitions. Word has length 260 [2019-11-25 08:45:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,154 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2310 transitions. [2019-11-25 08:45:34,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2310 transitions. [2019-11-25 08:45:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-25 08:45:34,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,160 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-11-25 08:45:34,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:34,373 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1088106038, now seen corresponding path program 1 times [2019-11-25 08:45:34,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793037087] [2019-11-25 08:45:34,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-25 08:45:34,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793037087] [2019-11-25 08:45:34,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566102272] [2019-11-25 08:45:34,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,513 INFO L87 Difference]: Start difference. First operand 1586 states and 2310 transitions. Second operand 3 states. [2019-11-25 08:45:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,609 INFO L93 Difference]: Finished difference Result 4663 states and 6788 transitions. [2019-11-25 08:45:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-25 08:45:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,616 INFO L225 Difference]: With dead ends: 4663 [2019-11-25 08:45:34,616 INFO L226 Difference]: Without dead ends: 3084 [2019-11-25 08:45:34,618 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-11-25 08:45:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2019-11-25 08:45:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3082. [2019-11-25 08:45:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-11-25 08:45:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4479 transitions. [2019-11-25 08:45:34,733 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4479 transitions. Word has length 270 [2019-11-25 08:45:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,734 INFO L462 AbstractCegarLoop]: Abstraction has 3082 states and 4479 transitions. [2019-11-25 08:45:34,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4479 transitions. [2019-11-25 08:45:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-25 08:45:34,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,742 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-11-25 08:45:34,742 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,742 INFO L82 PathProgramCache]: Analyzing trace with hash 420200473, now seen corresponding path program 1 times [2019-11-25 08:45:34,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755777317] [2019-11-25 08:45:34,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-25 08:45:34,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755777317] [2019-11-25 08:45:34,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814427536] [2019-11-25 08:45:34,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,845 INFO L87 Difference]: Start difference. First operand 3082 states and 4479 transitions. Second operand 3 states. [2019-11-25 08:45:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,107 INFO L93 Difference]: Finished difference Result 6317 states and 9203 transitions. [2019-11-25 08:45:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:35,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-25 08:45:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,111 INFO L225 Difference]: With dead ends: 6317 [2019-11-25 08:45:35,111 INFO L226 Difference]: Without dead ends: 2034 [2019-11-25 08:45:35,116 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-11-25 08:45:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-11-25 08:45:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2014. [2019-11-25 08:45:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-11-25 08:45:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2877 transitions. [2019-11-25 08:45:35,189 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2877 transitions. Word has length 307 [2019-11-25 08:45:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:35,190 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2877 transitions. [2019-11-25 08:45:35,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2877 transitions. [2019-11-25 08:45:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-11-25 08:45:35,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:35,198 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-11-25 08:45:35,198 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash 982370538, now seen corresponding path program 1 times [2019-11-25 08:45:35,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:35,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115401906] [2019-11-25 08:45:35,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-25 08:45:35,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115401906] [2019-11-25 08:45:35,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998494308] [2019-11-25 08:45:35,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:35,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:35,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-25 08:45:35,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:35,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:45:35,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856319138] [2019-11-25 08:45:35,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:35,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:35,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:35,592 INFO L87 Difference]: Start difference. First operand 2014 states and 2877 transitions. Second operand 4 states. [2019-11-25 08:45:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,927 INFO L93 Difference]: Finished difference Result 4694 states and 6697 transitions. [2019-11-25 08:45:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:35,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-11-25 08:45:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,933 INFO L225 Difference]: With dead ends: 4694 [2019-11-25 08:45:35,933 INFO L226 Difference]: Without dead ends: 2643 [2019-11-25 08:45:35,937 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-11-25 08:45:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-11-25 08:45:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1989. [2019-11-25 08:45:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-25 08:45:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-25 08:45:36,010 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 372 [2019-11-25 08:45:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:36,011 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-25 08:45:36,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-25 08:45:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-25 08:45:36,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:36,025 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-11-25 08:45:36,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:36,230 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1689104854, now seen corresponding path program 1 times [2019-11-25 08:45:36,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:36,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427832400] [2019-11-25 08:45:36,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-25 08:45:36,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427832400] [2019-11-25 08:45:36,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540330041] [2019-11-25 08:45:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:36,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:45:36,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:45:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-25 08:45:37,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:45:37,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:45:37,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322381879] [2019-11-25 08:45:37,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:37,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:37,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:37,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:37,036 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 4 states. [2019-11-25 08:45:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:37,387 INFO L93 Difference]: Finished difference Result 4937 states and 6862 transitions. [2019-11-25 08:45:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:45:37,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-11-25 08:45:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:37,392 INFO L225 Difference]: With dead ends: 4937 [2019-11-25 08:45:37,392 INFO L226 Difference]: Without dead ends: 2814 [2019-11-25 08:45:37,397 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-11-25 08:45:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2019-11-25 08:45:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1989. [2019-11-25 08:45:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-25 08:45:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-25 08:45:37,472 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 600 [2019-11-25 08:45:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:37,472 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-25 08:45:37,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-25 08:45:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-11-25 08:45:37,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:37,487 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-11-25 08:45:37,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:45:37,692 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1687662778, now seen corresponding path program 1 times [2019-11-25 08:45:37,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:37,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082076765] [2019-11-25 08:45:37,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-25 08:45:38,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082076765] [2019-11-25 08:45:38,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:38,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:38,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040162684] [2019-11-25 08:45:38,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:38,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:38,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,016 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 3 states. [2019-11-25 08:45:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,223 INFO L93 Difference]: Finished difference Result 4007 states and 5539 transitions. [2019-11-25 08:45:38,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:38,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-11-25 08:45:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,228 INFO L225 Difference]: With dead ends: 4007 [2019-11-25 08:45:38,228 INFO L226 Difference]: Without dead ends: 2025 [2019-11-25 08:45:38,231 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-11-25 08:45:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-11-25 08:45:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1989. [2019-11-25 08:45:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-25 08:45:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2733 transitions. [2019-11-25 08:45:38,299 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2733 transitions. Word has length 667 [2019-11-25 08:45:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:38,300 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2733 transitions. [2019-11-25 08:45:38,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2733 transitions. [2019-11-25 08:45:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-11-25 08:45:38,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:38,316 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-11-25 08:45:38,316 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:38,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1182124796, now seen corresponding path program 1 times [2019-11-25 08:45:38,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:38,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529254750] [2019-11-25 08:45:38,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-25 08:45:38,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529254750] [2019-11-25 08:45:38,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:38,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:38,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100839727] [2019-11-25 08:45:38,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:38,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:38,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:38,754 INFO L87 Difference]: Start difference. First operand 1989 states and 2733 transitions. Second operand 3 states. [2019-11-25 08:45:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:38,952 INFO L93 Difference]: Finished difference Result 3986 states and 5473 transitions. [2019-11-25 08:45:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:38,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 681 [2019-11-25 08:45:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:38,957 INFO L225 Difference]: With dead ends: 3986 [2019-11-25 08:45:38,957 INFO L226 Difference]: Without dead ends: 2004 [2019-11-25 08:45:38,960 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-11-25 08:45:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-11-25 08:45:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1976. [2019-11-25 08:45:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-11-25 08:45:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2674 transitions. [2019-11-25 08:45:39,028 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2674 transitions. Word has length 681 [2019-11-25 08:45:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:39,029 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 2674 transitions. [2019-11-25 08:45:39,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2674 transitions. [2019-11-25 08:45:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-11-25 08:45:39,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:39,046 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-11-25 08:45:39,046 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 8635284, now seen corresponding path program 1 times [2019-11-25 08:45:39,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:39,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265452197] [2019-11-25 08:45:39,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-25 08:45:39,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265452197] [2019-11-25 08:45:39,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:39,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:39,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052161661] [2019-11-25 08:45:39,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:39,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:39,443 INFO L87 Difference]: Start difference. First operand 1976 states and 2674 transitions. Second operand 3 states. [2019-11-25 08:45:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:39,634 INFO L93 Difference]: Finished difference Result 4014 states and 5435 transitions. [2019-11-25 08:45:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:39,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 710 [2019-11-25 08:45:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:39,639 INFO L225 Difference]: With dead ends: 4014 [2019-11-25 08:45:39,639 INFO L226 Difference]: Without dead ends: 2027 [2019-11-25 08:45:39,642 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-11-25 08:45:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-25 08:45:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2018. [2019-11-25 08:45:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-11-25 08:45:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2719 transitions. [2019-11-25 08:45:39,712 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2719 transitions. Word has length 710 [2019-11-25 08:45:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:39,713 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 2719 transitions. [2019-11-25 08:45:39,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2719 transitions. [2019-11-25 08:45:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2019-11-25 08:45:39,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:39,730 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-11-25 08:45:39,730 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1819983258, now seen corresponding path program 1 times [2019-11-25 08:45:39,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:39,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327989308] [2019-11-25 08:45:39,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-25 08:45:40,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327989308] [2019-11-25 08:45:40,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:40,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:40,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212811005] [2019-11-25 08:45:40,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:40,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:40,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:40,088 INFO L87 Difference]: Start difference. First operand 2018 states and 2719 transitions. Second operand 3 states. [2019-11-25 08:45:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:40,233 INFO L93 Difference]: Finished difference Result 2591 states and 3474 transitions. [2019-11-25 08:45:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:40,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 725 [2019-11-25 08:45:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:40,235 INFO L225 Difference]: With dead ends: 2591 [2019-11-25 08:45:40,235 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:45:40,238 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-11-25 08:45:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:45:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:45:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:45:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:45:40,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 725 [2019-11-25 08:45:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:40,240 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:45:40,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:45:40,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:45:40,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:45:41,046 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-25 08:45:41,427 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-25 08:45:41,872 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-25 08:45:42,357 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-25 08:45:42,843 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-25 08:45:43,312 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-25 08:45:43,708 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-25 08:45:44,054 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-25 08:45:44,434 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-25 08:45:44,681 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-25 08:45:45,168 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:45:45,479 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:45:45,768 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-25 08:45:46,080 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:45:46,425 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-25 08:45:46,767 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-25 08:45:47,291 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-25 08:45:47,553 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-25 08:45:47,861 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-25 08:45:48,097 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-25 08:45:48,388 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-25 08:45:48,942 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-25 08:45:48,944 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L444 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L444 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-25 08:45:48,945 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 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-11-25 08:45:48,946 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 628) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-25 08:45:48,946 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-25 08:45:48,947 INFO L444 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:45:48,947 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-25 08:45:48,947 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,947 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,947 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L440 ceAbstractionStarter]: At program point L404(lines 395 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-25 08:45:48,948 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-25 08:45:48,949 INFO L444 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-25 08:45:48,949 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-25 08:45:48,949 INFO L444 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-25 08:45:48,949 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:48,949 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 615) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,949 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-25 08:45:48,949 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 627) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (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-11-25 08:45:48,950 INFO L447 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-25 08:45:48,950 INFO L447 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-25 08:45:48,950 INFO L444 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-25 08:45:48,951 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-25 08:45:48,952 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-25 08:45:48,952 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-25 08:45:48,952 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:45:48,952 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:45:48,953 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-25 08:45:48,954 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-25 08:45:48,954 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-25 08:45:48,954 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-25 08:45:48,954 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-25 08:45:48,954 INFO L440 ceAbstractionStarter]: 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-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-25 08:45:48,955 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-25 08:45:48,956 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-25 08:45:48,956 INFO L440 ceAbstractionStarter]: At program point L553(lines 65 677) the Hoare annotation is: false [2019-11-25 08:45:48,956 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-25 08:45:48,956 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:45:48,956 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .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-11-25 08:45:48,957 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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-11-25 08:45:48,957 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 621) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-25 08:45:48,957 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-25 08:45:48,958 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-25 08:45:48,958 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-25 08:45:48,958 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-25 08:45:48,958 INFO L447 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-25 08:45:48,958 INFO L444 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-25 08:45:48,958 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L440 ceAbstractionStarter]: 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-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L440 ceAbstractionStarter]: At program point L360(lines 342 378) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-25 08:45:48,959 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-25 08:45:48,960 INFO L444 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:45:48,960 INFO L440 ceAbstractionStarter]: At program point L394(lines 385 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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-11-25 08:45:48,960 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-25 08:45:48,960 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= 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-11-25 08:45:48,960 INFO L440 ceAbstractionStarter]: 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-11-25 08:45:48,960 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-25 08:45:48,960 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-25 08:45:48,960 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 671) no Hoare annotation was computed. [2019-11-25 08:45:48,961 INFO L447 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-25 08:45:48,961 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-25 08:45:48,961 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-25 08:45:48,961 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-25 08:45:48,961 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-25 08:45:48,961 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-25 08:45:48,961 INFO L440 ceAbstractionStarter]: 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-11-25 08:45:48,962 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,962 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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-11-25 08:45:48,962 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-25 08:45:48,962 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-25 08:45:48,962 INFO L444 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-25 08:45:49,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:45:49 BoogieIcfgContainer [2019-11-25 08:45:49,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:45:49,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:49,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:49,009 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:49,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/4) ... [2019-11-25 08:45:49,013 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:45:49,029 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:45:49,030 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:45:49,130 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_19bd419c-76d9-47a2-881d-4de628800539/bin/uautomizer/witness.graphml [2019-11-25 08:45:49,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:49,131 INFO L168 Benchmark]: Toolchain (without parser) took 25233.54 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 951.4 MB in the beginning and 1.9 GB in the end (delta: -965.1 MB). Peak memory consumption was 317.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:49,131 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:49,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:49,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:49,133 INFO L168 Benchmark]: Boogie Preprocessor took 35.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:49,133 INFO L168 Benchmark]: RCFGBuilder took 928.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:49,133 INFO L168 Benchmark]: TraceAbstraction took 23614.29 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -860.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-25 08:45:49,134 INFO L168 Benchmark]: Witness Printer took 120.88 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:49,135 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 473.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 928.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23614.29 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -860.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 120.88 ms. Allocated memory is still 2.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 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: 23.5s, OverallIterations: 37, TraceHistogramMax: 25, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.7s, HoareTripleCheckerStatistics: 5821 SDtfs, 4958 SDslu, 2005 SDs, 0 SdLazy, 3403 SolverSat, 1378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 227 NumberOfFragments, 3549 HoareAnnotationTreeSize, 29 FomulaSimplifications, 33715 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7568 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s 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...