./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.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_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/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 eba2b941566e2fb2ae010597707522fdb9036fd8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:57:55,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:55,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:55,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:55,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:55,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:55,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:55,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:55,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:55,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:55,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:55,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:55,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:55,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:55,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:55,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:55,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:55,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:55,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:55,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:55,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:55,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:55,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:55,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:55,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:55,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:55,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:55,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:55,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:55,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:55,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:55,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:55,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:55,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:55,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:55,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:55,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:55,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:55,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:55,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:55,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:55,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:57:55,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:55,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:55,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:55,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:55,722 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:55,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:55,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:55,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:55,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:55,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:55,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:55,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:55,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:55,724 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:55,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:55,725 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:55,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:55,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:55,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:55,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:55,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:55,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:55,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:55,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:55,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:55,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:55,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:55,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:55,730 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_5da89a5b-59d7-4e11-994b-9ebe5e633569/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 -> eba2b941566e2fb2ae010597707522fdb9036fd8 [2019-11-25 08:57:55,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:55,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:55,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:55,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:55,885 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:55,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-25 08:57:55,936 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/data/57c02eb88/c53324fd6aaf486793d1197e989b68f2/FLAG9e3c2c79e [2019-11-25 08:57:56,390 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:56,391 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-25 08:57:56,413 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/data/57c02eb88/c53324fd6aaf486793d1197e989b68f2/FLAG9e3c2c79e [2019-11-25 08:57:56,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/data/57c02eb88/c53324fd6aaf486793d1197e989b68f2 [2019-11-25 08:57:56,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:56,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:56,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:56,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:56,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:56,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:56" (1/1) ... [2019-11-25 08:57:56,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60777a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:56, skipping insertion in model container [2019-11-25 08:57:56,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:56" (1/1) ... [2019-11-25 08:57:56,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:56,989 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:57,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:57,377 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:57,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:57,452 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:57,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57 WrapperNode [2019-11-25 08:57:57,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:57,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:57,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:57,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:57,469 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:57:57" (1/1) ... [2019-11-25 08:57:57,478 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:57:57" (1/1) ... [2019-11-25 08:57:57,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:57,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:57,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:57,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:57,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... [2019-11-25 08:57:57,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:57,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:57,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:57,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:57,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/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:57:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:57,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:57,776 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:57:58,405 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:57:58,406 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:57:58,407 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:58,407 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-25 08:57:58,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:58 BoogieIcfgContainer [2019-11-25 08:57:58,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:58,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:58,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:58,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:58,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:56" (1/3) ... [2019-11-25 08:57:58,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cb49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:58, skipping insertion in model container [2019-11-25 08:57:58,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:57" (2/3) ... [2019-11-25 08:57:58,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cb49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:58, skipping insertion in model container [2019-11-25 08:57:58,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:58" (3/3) ... [2019-11-25 08:57:58,415 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-11-25 08:57:58,423 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:58,430 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:58,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:58,463 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:58,463 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:58,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:58,464 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:58,464 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:58,464 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:58,464 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:58,464 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-25 08:57:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:57:58,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:58,492 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:57:58,493 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2019-11-25 08:57:58,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:58,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898793246] [2019-11-25 08:57:58,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:58,709 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:57:58,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898793246] [2019-11-25 08:57:58,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:58,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:58,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213406863] [2019-11-25 08:57:58,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:58,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:58,730 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-25 08:57:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:59,076 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-25 08:57:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:59,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:57:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:59,091 INFO L225 Difference]: With dead ends: 332 [2019-11-25 08:57:59,091 INFO L226 Difference]: Without dead ends: 177 [2019-11-25 08:57:59,095 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:57:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-25 08:57:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-25 08:57:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-25 08:57:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-25 08:57:59,174 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-25 08:57:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:59,175 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-25 08:57:59,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-25 08:57:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:57:59,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:59,180 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, 1] [2019-11-25 08:57:59,180 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2019-11-25 08:57:59,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:59,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839578039] [2019-11-25 08:57:59,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:59,313 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:57:59,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839578039] [2019-11-25 08:57:59,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:59,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:59,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420506138] [2019-11-25 08:57:59,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:59,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:59,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:59,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:59,318 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-25 08:57:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:59,572 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-25 08:57:59,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:59,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-25 08:57:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:59,576 INFO L225 Difference]: With dead ends: 384 [2019-11-25 08:57:59,576 INFO L226 Difference]: Without dead ends: 218 [2019-11-25 08:57:59,577 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:57:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-25 08:57:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-25 08:57:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-25 08:57:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-25 08:57:59,605 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-25 08:57:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:59,605 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-25 08:57:59,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-25 08:57:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:57:59,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:59,610 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, 1] [2019-11-25 08:57:59,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2019-11-25 08:57:59,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:59,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213007313] [2019-11-25 08:57:59,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:59,679 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:57:59,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213007313] [2019-11-25 08:57:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:59,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990943226] [2019-11-25 08:57:59,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:59,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:59,682 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-25 08:57:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:59,909 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-25 08:57:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:59,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-25 08:57:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:59,913 INFO L225 Difference]: With dead ends: 448 [2019-11-25 08:57:59,913 INFO L226 Difference]: Without dead ends: 243 [2019-11-25 08:57:59,915 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:57:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-25 08:57:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-25 08:57:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-25 08:57:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-25 08:57:59,944 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-25 08:57:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:59,945 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-25 08:57:59,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-25 08:57:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:57:59,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:59,950 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, 1] [2019-11-25 08:57:59,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2019-11-25 08:57:59,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:59,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830302179] [2019-11-25 08:57:59,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:00,020 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:58:00,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830302179] [2019-11-25 08:58:00,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:00,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:00,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090934339] [2019-11-25 08:58:00,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:00,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:00,022 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-25 08:58:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:00,271 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-25 08:58:00,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:00,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:58:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:00,277 INFO L225 Difference]: With dead ends: 525 [2019-11-25 08:58:00,277 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:58:00,279 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:58:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:58:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-25 08:58:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-25 08:58:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-25 08:58:00,295 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-25 08:58:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:00,296 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-25 08:58:00,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-25 08:58:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:58:00,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:00,299 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, 1] [2019-11-25 08:58:00,299 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2019-11-25 08:58:00,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:00,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382446189] [2019-11-25 08:58:00,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:00,346 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:58:00,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382446189] [2019-11-25 08:58:00,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:00,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:00,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959311253] [2019-11-25 08:58:00,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:00,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:00,348 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-25 08:58:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:00,488 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-25 08:58:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:00,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:58:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:00,491 INFO L225 Difference]: With dead ends: 580 [2019-11-25 08:58:00,492 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:58:00,492 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:58:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:58:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-25 08:58:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-25 08:58:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-25 08:58:00,505 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-25 08:58:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:00,506 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-25 08:58:00,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-25 08:58:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:58:00,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:00,507 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, 1] [2019-11-25 08:58:00,508 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2019-11-25 08:58:00,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:00,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323137411] [2019-11-25 08:58:00,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:00,582 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:58:00,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323137411] [2019-11-25 08:58:00,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:00,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:00,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140110304] [2019-11-25 08:58:00,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:00,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:00,584 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-25 08:58:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:00,780 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-25 08:58:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:00,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:58:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:00,783 INFO L225 Difference]: With dead ends: 597 [2019-11-25 08:58:00,783 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:58:00,784 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:58:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:58:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-25 08:58:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-25 08:58:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-25 08:58:00,806 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-25 08:58:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:00,806 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-25 08:58:00,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-25 08:58:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:58:00,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:00,807 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, 1] [2019-11-25 08:58:00,808 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2019-11-25 08:58:00,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:00,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409116163] [2019-11-25 08:58:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:00,851 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:58:00,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409116163] [2019-11-25 08:58:00,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:00,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:00,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310076707] [2019-11-25 08:58:00,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:00,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:00,861 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-25 08:58:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:01,008 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-25 08:58:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:01,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-25 08:58:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:01,010 INFO L225 Difference]: With dead ends: 591 [2019-11-25 08:58:01,010 INFO L226 Difference]: Without dead ends: 300 [2019-11-25 08:58:01,011 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:58:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-25 08:58:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-25 08:58:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-25 08:58:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-25 08:58:01,023 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-25 08:58:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:01,023 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-25 08:58:01,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-25 08:58:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:58:01,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:01,026 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, 1, 1] [2019-11-25 08:58:01,027 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:01,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2019-11-25 08:58:01,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311161915] [2019-11-25 08:58:01,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:01,106 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:58:01,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311161915] [2019-11-25 08:58:01,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:01,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:01,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148973523] [2019-11-25 08:58:01,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:01,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:01,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:01,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:01,109 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-25 08:58:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:01,269 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-25 08:58:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:01,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:58:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:01,272 INFO L225 Difference]: With dead ends: 598 [2019-11-25 08:58:01,272 INFO L226 Difference]: Without dead ends: 307 [2019-11-25 08:58:01,273 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:58:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-25 08:58:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-25 08:58:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-25 08:58:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-25 08:58:01,287 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-25 08:58:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:01,288 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-25 08:58:01,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-25 08:58:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:58:01,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:01,289 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, 1] [2019-11-25 08:58:01,290 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2019-11-25 08:58:01,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267117734] [2019-11-25 08:58:01,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:01,364 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:58:01,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267117734] [2019-11-25 08:58:01,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:01,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:01,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074826778] [2019-11-25 08:58:01,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:01,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:01,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:01,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:01,372 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-25 08:58:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:01,539 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-25 08:58:01,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:01,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:58:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:01,542 INFO L225 Difference]: With dead ends: 638 [2019-11-25 08:58:01,542 INFO L226 Difference]: Without dead ends: 338 [2019-11-25 08:58:01,543 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:58:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-25 08:58:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-25 08:58:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-25 08:58:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-25 08:58:01,557 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-25 08:58:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:01,557 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-25 08:58:01,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-25 08:58:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:58:01,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:01,559 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, 1] [2019-11-25 08:58:01,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2019-11-25 08:58:01,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183309883] [2019-11-25 08:58:01,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:01,608 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:58:01,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183309883] [2019-11-25 08:58:01,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:01,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:01,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843053923] [2019-11-25 08:58:01,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:01,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:01,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:01,611 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-25 08:58:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:01,790 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-25 08:58:01,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:01,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:58:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:01,793 INFO L225 Difference]: With dead ends: 667 [2019-11-25 08:58:01,793 INFO L226 Difference]: Without dead ends: 338 [2019-11-25 08:58:01,794 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:58:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-25 08:58:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-25 08:58:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-25 08:58:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-25 08:58:01,810 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-25 08:58:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:01,811 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-25 08:58:01,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-25 08:58:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:58:01,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:01,813 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, 1, 1] [2019-11-25 08:58:01,813 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2019-11-25 08:58:01,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:01,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209116238] [2019-11-25 08:58:01,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:01,859 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:58:01,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209116238] [2019-11-25 08:58:01,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:01,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:01,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077856773] [2019-11-25 08:58:01,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:01,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:01,861 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-25 08:58:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:02,021 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-25 08:58:02,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:02,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-25 08:58:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:02,025 INFO L225 Difference]: With dead ends: 700 [2019-11-25 08:58:02,025 INFO L226 Difference]: Without dead ends: 371 [2019-11-25 08:58:02,026 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:58:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-25 08:58:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-25 08:58:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-25 08:58:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-25 08:58:02,039 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-25 08:58:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:02,039 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-25 08:58:02,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-25 08:58:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:58:02,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:02,041 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, 1, 1] [2019-11-25 08:58:02,042 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2019-11-25 08:58:02,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:02,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640759324] [2019-11-25 08:58:02,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:02,085 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:58:02,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640759324] [2019-11-25 08:58:02,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:02,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:02,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816882453] [2019-11-25 08:58:02,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:02,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:02,087 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-25 08:58:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:02,247 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-25 08:58:02,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:02,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-25 08:58:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:02,250 INFO L225 Difference]: With dead ends: 727 [2019-11-25 08:58:02,250 INFO L226 Difference]: Without dead ends: 371 [2019-11-25 08:58:02,251 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:58:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-25 08:58:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-25 08:58:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-25 08:58:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-25 08:58:02,267 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-25 08:58:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:02,267 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-25 08:58:02,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-25 08:58:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:58:02,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:02,269 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, 1] [2019-11-25 08:58:02,270 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2019-11-25 08:58:02,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:02,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445199212] [2019-11-25 08:58:02,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:02,303 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:58:02,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445199212] [2019-11-25 08:58:02,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:02,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:02,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861646518] [2019-11-25 08:58:02,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:02,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:02,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:02,305 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-25 08:58:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:02,457 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-25 08:58:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:02,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:58:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:02,461 INFO L225 Difference]: With dead ends: 744 [2019-11-25 08:58:02,461 INFO L226 Difference]: Without dead ends: 388 [2019-11-25 08:58:02,462 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:58:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-25 08:58:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-25 08:58:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-25 08:58:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-25 08:58:02,477 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-25 08:58:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:02,478 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-25 08:58:02,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-25 08:58:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:58:02,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:02,482 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, 1] [2019-11-25 08:58:02,482 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2019-11-25 08:58:02,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:02,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123944991] [2019-11-25 08:58:02,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:02,522 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:58:02,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123944991] [2019-11-25 08:58:02,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:02,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:02,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303005932] [2019-11-25 08:58:02,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:02,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:02,524 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-25 08:58:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:02,675 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-25 08:58:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:02,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:58:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:02,678 INFO L225 Difference]: With dead ends: 765 [2019-11-25 08:58:02,678 INFO L226 Difference]: Without dead ends: 388 [2019-11-25 08:58:02,679 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:58:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-25 08:58:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-25 08:58:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-25 08:58:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-25 08:58:02,694 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-25 08:58:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:02,694 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-25 08:58:02,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-25 08:58:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:58:02,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:02,696 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, 1] [2019-11-25 08:58:02,697 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2019-11-25 08:58:02,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:02,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017399748] [2019-11-25 08:58:02,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:58:02,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017399748] [2019-11-25 08:58:02,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:02,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:02,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77362367] [2019-11-25 08:58:02,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:02,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:02,746 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-25 08:58:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:02,803 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-25 08:58:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:02,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:58:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:02,808 INFO L225 Difference]: With dead ends: 1092 [2019-11-25 08:58:02,808 INFO L226 Difference]: Without dead ends: 715 [2019-11-25 08:58:02,809 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:58:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-25 08:58:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-25 08:58:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-25 08:58:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-25 08:58:02,837 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-25 08:58:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:02,837 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-25 08:58:02,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-25 08:58:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:58:02,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:02,840 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, 1] [2019-11-25 08:58:02,840 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2019-11-25 08:58:02,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:02,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122006378] [2019-11-25 08:58:02,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:02,894 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:58:02,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122006378] [2019-11-25 08:58:02,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:02,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:02,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727421222] [2019-11-25 08:58:02,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:02,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:02,896 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2019-11-25 08:58:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:02,970 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2019-11-25 08:58:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:02,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:58:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:02,977 INFO L225 Difference]: With dead ends: 1798 [2019-11-25 08:58:02,978 INFO L226 Difference]: Without dead ends: 1090 [2019-11-25 08:58:02,979 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:58:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-11-25 08:58:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2019-11-25 08:58:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-11-25 08:58:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2019-11-25 08:58:03,022 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2019-11-25 08:58:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:03,023 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2019-11-25 08:58:03,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2019-11-25 08:58:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 08:58:03,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:03,026 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, 1] [2019-11-25 08:58:03,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2019-11-25 08:58:03,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973000007] [2019-11-25 08:58:03,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,068 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:58:03,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973000007] [2019-11-25 08:58:03,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:03,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:03,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802143089] [2019-11-25 08:58:03,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:03,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:03,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:03,070 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2019-11-25 08:58:03,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:03,262 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2019-11-25 08:58:03,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:03,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-25 08:58:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:03,269 INFO L225 Difference]: With dead ends: 2299 [2019-11-25 08:58:03,269 INFO L226 Difference]: Without dead ends: 1216 [2019-11-25 08:58:03,271 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:58:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-11-25 08:58:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2019-11-25 08:58:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-25 08:58:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2019-11-25 08:58:03,312 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2019-11-25 08:58:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:03,313 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2019-11-25 08:58:03,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2019-11-25 08:58:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:58:03,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:03,316 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, 1] [2019-11-25 08:58:03,317 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2019-11-25 08:58:03,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013355336] [2019-11-25 08:58:03,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,351 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:58:03,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013355336] [2019-11-25 08:58:03,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:03,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:03,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135128369] [2019-11-25 08:58:03,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:03,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:03,353 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2019-11-25 08:58:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:03,556 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2019-11-25 08:58:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:03,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-25 08:58:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:03,563 INFO L225 Difference]: With dead ends: 2413 [2019-11-25 08:58:03,564 INFO L226 Difference]: Without dead ends: 1210 [2019-11-25 08:58:03,565 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:58:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-25 08:58:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2019-11-25 08:58:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-11-25 08:58:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2019-11-25 08:58:03,606 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2019-11-25 08:58:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:03,606 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2019-11-25 08:58:03,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2019-11-25 08:58:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-25 08:58:03,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:03,610 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, 1] [2019-11-25 08:58:03,610 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2019-11-25 08:58:03,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704170888] [2019-11-25 08:58:03,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,654 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:58:03,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704170888] [2019-11-25 08:58:03,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:03,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:03,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656919903] [2019-11-25 08:58:03,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:03,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:03,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:03,657 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2019-11-25 08:58:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:03,832 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2019-11-25 08:58:03,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:03,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-25 08:58:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:03,840 INFO L225 Difference]: With dead ends: 2503 [2019-11-25 08:58:03,840 INFO L226 Difference]: Without dead ends: 1312 [2019-11-25 08:58:03,842 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:58:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-11-25 08:58:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2019-11-25 08:58:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-11-25 08:58:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2019-11-25 08:58:03,884 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2019-11-25 08:58:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:03,884 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2019-11-25 08:58:03,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2019-11-25 08:58:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:58:03,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:03,889 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, 1] [2019-11-25 08:58:03,889 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2019-11-25 08:58:03,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:03,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817550566] [2019-11-25 08:58:03,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:03,961 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:58:03,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817550566] [2019-11-25 08:58:03,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:03,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:03,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939817470] [2019-11-25 08:58:03,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:03,963 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2019-11-25 08:58:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:04,166 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2019-11-25 08:58:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-25 08:58:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:04,174 INFO L225 Difference]: With dead ends: 2611 [2019-11-25 08:58:04,174 INFO L226 Difference]: Without dead ends: 1306 [2019-11-25 08:58:04,176 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:58:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-11-25 08:58:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2019-11-25 08:58:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-11-25 08:58:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2019-11-25 08:58:04,216 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2019-11-25 08:58:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:04,216 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2019-11-25 08:58:04,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2019-11-25 08:58:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-25 08:58:04,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:04,221 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, 1] [2019-11-25 08:58:04,221 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2019-11-25 08:58:04,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012228773] [2019-11-25 08:58:04,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:04,275 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:58:04,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012228773] [2019-11-25 08:58:04,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:04,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:04,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565508074] [2019-11-25 08:58:04,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:04,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:04,278 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2019-11-25 08:58:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:04,468 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2019-11-25 08:58:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:04,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-25 08:58:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:04,476 INFO L225 Difference]: With dead ends: 2701 [2019-11-25 08:58:04,476 INFO L226 Difference]: Without dead ends: 1408 [2019-11-25 08:58:04,478 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:58:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-11-25 08:58:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2019-11-25 08:58:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-11-25 08:58:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-11-25 08:58:04,522 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2019-11-25 08:58:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:04,523 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-11-25 08:58:04,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-11-25 08:58:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-25 08:58:04,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:04,527 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, 1] [2019-11-25 08:58:04,528 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2019-11-25 08:58:04,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127099826] [2019-11-25 08:58:04,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:04,580 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:58:04,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127099826] [2019-11-25 08:58:04,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:04,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:04,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152790351] [2019-11-25 08:58:04,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:04,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:04,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:04,582 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2019-11-25 08:58:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:04,768 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2019-11-25 08:58:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:04,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-25 08:58:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:04,775 INFO L225 Difference]: With dead ends: 2803 [2019-11-25 08:58:04,775 INFO L226 Difference]: Without dead ends: 1402 [2019-11-25 08:58:04,777 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:58:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-11-25 08:58:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2019-11-25 08:58:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-11-25 08:58:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2019-11-25 08:58:04,821 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2019-11-25 08:58:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:04,821 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2019-11-25 08:58:04,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2019-11-25 08:58:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-25 08:58:04,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:04,826 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, 1, 1] [2019-11-25 08:58:04,826 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2019-11-25 08:58:04,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:04,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344219564] [2019-11-25 08:58:04,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:04,928 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:58:04,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344219564] [2019-11-25 08:58:04,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:04,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:04,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545223609] [2019-11-25 08:58:04,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:04,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:04,932 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2019-11-25 08:58:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:05,100 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2019-11-25 08:58:05,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:05,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-25 08:58:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:05,108 INFO L225 Difference]: With dead ends: 2899 [2019-11-25 08:58:05,108 INFO L226 Difference]: Without dead ends: 1510 [2019-11-25 08:58:05,110 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:58:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-25 08:58:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-11-25 08:58:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-25 08:58:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2019-11-25 08:58:05,154 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2019-11-25 08:58:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:05,154 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2019-11-25 08:58:05,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2019-11-25 08:58:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-25 08:58:05,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:05,159 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, 1, 1] [2019-11-25 08:58:05,159 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2019-11-25 08:58:05,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486623997] [2019-11-25 08:58:05,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:05,213 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:58:05,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486623997] [2019-11-25 08:58:05,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:05,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:05,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524141276] [2019-11-25 08:58:05,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:05,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:05,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:05,216 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2019-11-25 08:58:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:05,374 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2019-11-25 08:58:05,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:05,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-25 08:58:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:05,382 INFO L225 Difference]: With dead ends: 2974 [2019-11-25 08:58:05,382 INFO L226 Difference]: Without dead ends: 1510 [2019-11-25 08:58:05,385 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:58:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-25 08:58:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-11-25 08:58:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-25 08:58:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2019-11-25 08:58:05,431 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2019-11-25 08:58:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:05,432 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2019-11-25 08:58:05,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2019-11-25 08:58:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-25 08:58:05,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:05,436 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, 1] [2019-11-25 08:58:05,437 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2019-11-25 08:58:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360446930] [2019-11-25 08:58:05,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:05,496 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:58:05,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360446930] [2019-11-25 08:58:05,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:05,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:05,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980818839] [2019-11-25 08:58:05,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:05,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:05,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:05,498 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2019-11-25 08:58:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:05,677 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2019-11-25 08:58:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:05,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-25 08:58:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:05,685 INFO L225 Difference]: With dead ends: 2947 [2019-11-25 08:58:05,685 INFO L226 Difference]: Without dead ends: 1483 [2019-11-25 08:58:05,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2019-11-25 08:58:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2019-11-25 08:58:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-25 08:58:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2019-11-25 08:58:05,731 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2019-11-25 08:58:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:05,732 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2019-11-25 08:58:05,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2019-11-25 08:58:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-25 08:58:05,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:05,736 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, 1] [2019-11-25 08:58:05,737 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2019-11-25 08:58:05,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:05,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130687455] [2019-11-25 08:58:05,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:05,816 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:58:05,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130687455] [2019-11-25 08:58:05,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:05,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:05,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182422937] [2019-11-25 08:58:05,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:05,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:05,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:05,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:05,818 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2019-11-25 08:58:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:06,000 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2019-11-25 08:58:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:06,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-25 08:58:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:06,009 INFO L225 Difference]: With dead ends: 2947 [2019-11-25 08:58:06,009 INFO L226 Difference]: Without dead ends: 1456 [2019-11-25 08:58:06,011 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:58:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-25 08:58:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2019-11-25 08:58:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-11-25 08:58:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2019-11-25 08:58:06,057 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2019-11-25 08:58:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:06,058 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2019-11-25 08:58:06,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2019-11-25 08:58:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-25 08:58:06,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:06,062 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, 1, 1, 1] [2019-11-25 08:58:06,063 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2019-11-25 08:58:06,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029451795] [2019-11-25 08:58:06,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:06,114 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:58:06,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029451795] [2019-11-25 08:58:06,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:06,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:06,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464098201] [2019-11-25 08:58:06,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:06,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:06,116 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2019-11-25 08:58:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:06,282 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2019-11-25 08:58:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:06,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-25 08:58:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:06,290 INFO L225 Difference]: With dead ends: 2962 [2019-11-25 08:58:06,290 INFO L226 Difference]: Without dead ends: 1525 [2019-11-25 08:58:06,292 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:58:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-11-25 08:58:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2019-11-25 08:58:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-11-25 08:58:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2019-11-25 08:58:06,339 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2019-11-25 08:58:06,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:06,340 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2019-11-25 08:58:06,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2019-11-25 08:58:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-25 08:58:06,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:06,345 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, 1, 1, 1] [2019-11-25 08:58:06,345 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2019-11-25 08:58:06,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876254484] [2019-11-25 08:58:06,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:06,398 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:58:06,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876254484] [2019-11-25 08:58:06,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:06,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:06,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890261729] [2019-11-25 08:58:06,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:06,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:06,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:06,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:06,401 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2019-11-25 08:58:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:06,570 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2019-11-25 08:58:06,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:06,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-25 08:58:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:06,579 INFO L225 Difference]: With dead ends: 3031 [2019-11-25 08:58:06,579 INFO L226 Difference]: Without dead ends: 1513 [2019-11-25 08:58:06,581 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:58:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-25 08:58:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2019-11-25 08:58:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-25 08:58:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2019-11-25 08:58:06,628 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2019-11-25 08:58:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:06,628 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2019-11-25 08:58:06,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2019-11-25 08:58:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:58:06,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:06,634 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, 1, 1, 1] [2019-11-25 08:58:06,634 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2019-11-25 08:58:06,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954091784] [2019-11-25 08:58:06,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-11-25 08:58:06,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954091784] [2019-11-25 08:58:06,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:06,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:06,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602646433] [2019-11-25 08:58:06,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:06,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:06,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:06,728 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2019-11-25 08:58:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:06,797 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2019-11-25 08:58:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:06,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:58:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:06,819 INFO L225 Difference]: With dead ends: 3052 [2019-11-25 08:58:06,826 INFO L226 Difference]: Without dead ends: 1558 [2019-11-25 08:58:06,828 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:58:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-11-25 08:58:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2019-11-25 08:58:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-25 08:58:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2019-11-25 08:58:06,904 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2019-11-25 08:58:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:06,904 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2019-11-25 08:58:06,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2019-11-25 08:58:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:58:06,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:06,910 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, 1, 1, 1] [2019-11-25 08:58:06,911 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2019-11-25 08:58:06,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:06,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133151436] [2019-11-25 08:58:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-11-25 08:58:06,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133151436] [2019-11-25 08:58:06,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:06,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:06,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360090414] [2019-11-25 08:58:06,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:06,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:06,977 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2019-11-25 08:58:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:07,032 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2019-11-25 08:58:07,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:07,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:58:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:07,035 INFO L225 Difference]: With dead ends: 3142 [2019-11-25 08:58:07,036 INFO L226 Difference]: Without dead ends: 1591 [2019-11-25 08:58:07,038 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:58:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-11-25 08:58:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2019-11-25 08:58:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-25 08:58:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2019-11-25 08:58:07,086 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2019-11-25 08:58:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:07,086 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2019-11-25 08:58:07,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2019-11-25 08:58:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-25 08:58:07,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:07,091 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:07,092 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2019-11-25 08:58:07,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:07,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884497339] [2019-11-25 08:58:07,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-25 08:58:07,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884497339] [2019-11-25 08:58:07,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:07,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:07,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077388905] [2019-11-25 08:58:07,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:07,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:07,224 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2019-11-25 08:58:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:07,303 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2019-11-25 08:58:07,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:07,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-25 08:58:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:07,309 INFO L225 Difference]: With dead ends: 4612 [2019-11-25 08:58:07,309 INFO L226 Difference]: Without dead ends: 3061 [2019-11-25 08:58:07,311 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:58:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-11-25 08:58:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2019-11-25 08:58:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-11-25 08:58:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2019-11-25 08:58:07,405 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2019-11-25 08:58:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:07,406 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2019-11-25 08:58:07,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2019-11-25 08:58:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-25 08:58:07,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:07,412 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, 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:58:07,412 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2019-11-25 08:58:07,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:07,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442053964] [2019-11-25 08:58:07,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-25 08:58:07,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442053964] [2019-11-25 08:58:07,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:07,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:07,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723908944] [2019-11-25 08:58:07,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:07,547 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2019-11-25 08:58:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:07,753 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2019-11-25 08:58:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:07,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-11-25 08:58:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:07,757 INFO L225 Difference]: With dead ends: 6291 [2019-11-25 08:58:07,757 INFO L226 Difference]: Without dead ends: 2043 [2019-11-25 08:58:07,762 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:58:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-11-25 08:58:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2019-11-25 08:58:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-25 08:58:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2019-11-25 08:58:07,815 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2019-11-25 08:58:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:07,816 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2019-11-25 08:58:07,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2019-11-25 08:58:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-25 08:58:07,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:07,820 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:07,821 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2019-11-25 08:58:07,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:07,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39424312] [2019-11-25 08:58:07,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-11-25 08:58:07,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39424312] [2019-11-25 08:58:07,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220816768] [2019-11-25 08:58:07,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/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:58:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:08,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:58:08,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-25 08:58:08,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:58:08,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:58:08,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222662656] [2019-11-25 08:58:08,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:08,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:08,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:08,287 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 3 states. [2019-11-25 08:58:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:08,393 INFO L93 Difference]: Finished difference Result 4660 states and 6632 transitions. [2019-11-25 08:58:08,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:08,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-25 08:58:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:08,399 INFO L225 Difference]: With dead ends: 4660 [2019-11-25 08:58:08,400 INFO L226 Difference]: Without dead ends: 2676 [2019-11-25 08:58:08,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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:58:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-11-25 08:58:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2676. [2019-11-25 08:58:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-11-25 08:58:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3798 transitions. [2019-11-25 08:58:08,517 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3798 transitions. Word has length 375 [2019-11-25 08:58:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:08,518 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3798 transitions. [2019-11-25 08:58:08,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3798 transitions. [2019-11-25 08:58:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-25 08:58:08,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:08,524 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:08,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:08,732 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash 490258226, now seen corresponding path program 1 times [2019-11-25 08:58:08,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:08,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829709387] [2019-11-25 08:58:08,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-25 08:58:08,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829709387] [2019-11-25 08:58:08,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77191668] [2019-11-25 08:58:08,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/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:58:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:09,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:58:09,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-11-25 08:58:09,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:58:09,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:58:09,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571089315] [2019-11-25 08:58:09,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:09,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:09,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:09,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:58:09,225 INFO L87 Difference]: Start difference. First operand 2676 states and 3798 transitions. Second operand 3 states. [2019-11-25 08:58:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:09,276 INFO L93 Difference]: Finished difference Result 2736 states and 3882 transitions. [2019-11-25 08:58:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:09,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-11-25 08:58:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:09,281 INFO L225 Difference]: With dead ends: 2736 [2019-11-25 08:58:09,281 INFO L226 Difference]: Without dead ends: 2143 [2019-11-25 08:58:09,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 446 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:58:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-11-25 08:58:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2085. [2019-11-25 08:58:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-11-25 08:58:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2968 transitions. [2019-11-25 08:58:09,337 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2968 transitions. Word has length 446 [2019-11-25 08:58:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:09,338 INFO L462 AbstractCegarLoop]: Abstraction has 2085 states and 2968 transitions. [2019-11-25 08:58:09,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2968 transitions. [2019-11-25 08:58:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-25 08:58:09,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:09,344 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:09,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:09,548 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:09,549 INFO L82 PathProgramCache]: Analyzing trace with hash 567159024, now seen corresponding path program 1 times [2019-11-25 08:58:09,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:09,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680128069] [2019-11-25 08:58:09,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-25 08:58:09,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680128069] [2019-11-25 08:58:09,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032583555] [2019-11-25 08:58:09,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/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:58:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:09,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:58:09,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-25 08:58:10,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:58:10,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:58:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96918265] [2019-11-25 08:58:10,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:10,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:10,008 INFO L87 Difference]: Start difference. First operand 2085 states and 2968 transitions. Second operand 4 states. [2019-11-25 08:58:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:10,336 INFO L93 Difference]: Finished difference Result 4343 states and 6173 transitions. [2019-11-25 08:58:10,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:58:10,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2019-11-25 08:58:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:10,341 INFO L225 Difference]: With dead ends: 4343 [2019-11-25 08:58:10,341 INFO L226 Difference]: Without dead ends: 2221 [2019-11-25 08:58:10,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 448 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:58:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-11-25 08:58:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1935. [2019-11-25 08:58:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-25 08:58:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-11-25 08:58:10,433 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 446 [2019-11-25 08:58:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:10,434 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-11-25 08:58:10,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-11-25 08:58:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-25 08:58:10,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:10,487 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:10,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:10,688 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 260585257, now seen corresponding path program 1 times [2019-11-25 08:58:10,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:10,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027110165] [2019-11-25 08:58:10,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-25 08:58:11,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027110165] [2019-11-25 08:58:11,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869790142] [2019-11-25 08:58:11,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:11,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:58:11,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-25 08:58:12,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:58:12,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:58:12,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682544238] [2019-11-25 08:58:12,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:12,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:12,018 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 4 states. [2019-11-25 08:58:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:12,300 INFO L93 Difference]: Finished difference Result 4591 states and 6320 transitions. [2019-11-25 08:58:12,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:12,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-11-25 08:58:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:12,306 INFO L225 Difference]: With dead ends: 4591 [2019-11-25 08:58:12,306 INFO L226 Difference]: Without dead ends: 2601 [2019-11-25 08:58:12,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 849 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:58:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-11-25 08:58:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1935. [2019-11-25 08:58:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-25 08:58:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-11-25 08:58:12,372 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 847 [2019-11-25 08:58:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:12,373 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-11-25 08:58:12,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-11-25 08:58:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-11-25 08:58:12,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:12,384 INFO L410 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:12,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:12,589 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2019-11-25 08:58:12,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:12,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395860056] [2019-11-25 08:58:12,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-11-25 08:58:13,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395860056] [2019-11-25 08:58:13,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:13,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:13,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919061287] [2019-11-25 08:58:13,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:13,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:13,283 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2019-11-25 08:58:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:13,465 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2019-11-25 08:58:13,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:13,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2019-11-25 08:58:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:13,469 INFO L225 Difference]: With dead ends: 3871 [2019-11-25 08:58:13,470 INFO L226 Difference]: Without dead ends: 1975 [2019-11-25 08:58:13,472 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:58:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-11-25 08:58:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2019-11-25 08:58:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-25 08:58:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2019-11-25 08:58:13,525 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2019-11-25 08:58:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:13,525 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2019-11-25 08:58:13,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2019-11-25 08:58:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-25 08:58:13,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:13,536 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:58:13,537 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2019-11-25 08:58:13,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:13,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062838989] [2019-11-25 08:58:13,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-11-25 08:58:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062838989] [2019-11-25 08:58:14,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:14,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:14,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752825633] [2019-11-25 08:58:14,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:14,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:14,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:14,254 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2019-11-25 08:58:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:14,418 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2019-11-25 08:58:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:14,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2019-11-25 08:58:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:14,422 INFO L225 Difference]: With dead ends: 3831 [2019-11-25 08:58:14,422 INFO L226 Difference]: Without dead ends: 1935 [2019-11-25 08:58:14,424 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:58:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-11-25 08:58:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-11-25 08:58:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-25 08:58:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2019-11-25 08:58:14,476 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2019-11-25 08:58:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:14,477 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2019-11-25 08:58:14,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2019-11-25 08:58:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-11-25 08:58:14,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:14,488 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:14,488 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:14,489 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2019-11-25 08:58:14,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:14,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796938074] [2019-11-25 08:58:14,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-11-25 08:58:15,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796938074] [2019-11-25 08:58:15,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:15,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:15,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652611591] [2019-11-25 08:58:15,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:15,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:15,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:15,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:15,103 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2019-11-25 08:58:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:15,253 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2019-11-25 08:58:15,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:15,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-11-25 08:58:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:15,257 INFO L225 Difference]: With dead ends: 3871 [2019-11-25 08:58:15,257 INFO L226 Difference]: Without dead ends: 1963 [2019-11-25 08:58:15,260 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:58:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-11-25 08:58:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-11-25 08:58:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-11-25 08:58:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2019-11-25 08:58:15,312 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2019-11-25 08:58:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:15,313 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2019-11-25 08:58:15,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2019-11-25 08:58:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-11-25 08:58:15,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:15,325 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 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, 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] [2019-11-25 08:58:15,325 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2019-11-25 08:58:15,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:15,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309438445] [2019-11-25 08:58:15,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-11-25 08:58:16,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309438445] [2019-11-25 08:58:16,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:16,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:16,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579525508] [2019-11-25 08:58:16,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:16,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:16,183 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2019-11-25 08:58:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:16,336 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2019-11-25 08:58:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:16,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-11-25 08:58:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:16,338 INFO L225 Difference]: With dead ends: 2491 [2019-11-25 08:58:16,338 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:58:16,340 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:58:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:58:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:58:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:58:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:58:16,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2019-11-25 08:58:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:16,341 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:58:16,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:58:16,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:58:16,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:58:16,866 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 130 [2019-11-25 08:58:17,224 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 128 [2019-11-25 08:58:17,853 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:58:18,362 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-25 08:58:18,881 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-11-25 08:58:19,085 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-25 08:58:19,338 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-25 08:58:19,725 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-11-25 08:58:20,481 WARN L192 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-11-25 08:58:20,738 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-25 08:58:21,009 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:58:21,281 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:58:21,582 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-25 08:58:21,871 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:58:22,194 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-25 08:58:22,403 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-25 08:58:23,020 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-11-25 08:58:23,460 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-25 08:58:23,748 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-25 08:58:24,005 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-25 08:58:24,267 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 08:58:24,558 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-25 08:58:25,074 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-11-25 08:58:25,077 INFO L447 ceAbstractionStarter]: At program point L630(lines 621 632) the Hoare annotation is: true [2019-11-25 08:58:25,077 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-25 08:58:25,077 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-11-25 08:58:25,078 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 551) 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:58:25,078 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 583) 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:58:25,079 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 308) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L301-2(lines 301 308) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 549) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 560) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 571) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 582) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 540) no Hoare annotation was computed. [2019-11-25 08:58:25,079 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 534 540) no Hoare annotation was computed. [2019-11-25 08:58:25,080 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 360) no Hoare annotation was computed. [2019-11-25 08:58:25,080 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-25 08:58:25,080 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-25 08:58:25,080 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 572) 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))) (.cse12 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.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))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse13 .cse11) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse12 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8 .cse13 .cse11))) [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 273) no Hoare annotation was computed. [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L271-2(lines 207 546) no Hoare annotation was computed. [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 250) no Hoare annotation was computed. [2019-11-25 08:58:25,081 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 559) no Hoare annotation was computed. [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 570) no Hoare annotation was computed. [2019-11-25 08:58:25,081 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 581) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L447 ceAbstractionStarter]: At program point L603(lines 97 604) the Hoare annotation is: true [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L340-2(lines 340 344) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L374(lines 374 406) no Hoare annotation was computed. [2019-11-25 08:58:25,082 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 558) no Hoare annotation was computed. [2019-11-25 08:58:25,083 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 569) no Hoare annotation was computed. [2019-11-25 08:58:25,083 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 580) no Hoare annotation was computed. [2019-11-25 08:58:25,083 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-25 08:58:25,083 INFO L444 ceAbstractionStarter]: For program point L474-2(lines 207 546) no Hoare annotation was computed. [2019-11-25 08:58:25,083 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-11-25 08:58:25,083 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 582) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:58:25,084 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 559) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,084 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 570) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,084 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-25 08:58:25,084 INFO L444 ceAbstractionStarter]: For program point L608(lines 608 610) no Hoare annotation was computed. [2019-11-25 08:58:25,084 INFO L444 ceAbstractionStarter]: For program point L608-2(lines 608 610) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 557) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 568) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 579) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L447 ceAbstractionStarter]: At program point L611(lines 11 615) the Hoare annotation is: true [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 556) no Hoare annotation was computed. [2019-11-25 08:58:25,085 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 567) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 578) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 519) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L444 ceAbstractionStarter]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 356) no Hoare annotation was computed. [2019-11-25 08:58:25,086 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 557) 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))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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 .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))) (and .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-11-25 08:58:25,087 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 568) 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 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,087 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-25 08:58:25,087 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-25 08:58:25,089 INFO L440 ceAbstractionStarter]: At program point L547(lines 98 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.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 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 (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))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse4 .cse5 .cse13 .cse14 .cse6))) [2019-11-25 08:58:25,090 INFO L440 ceAbstractionStarter]: At program point L349(lines 324 367) 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 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,090 INFO L444 ceAbstractionStarter]: For program point L416(lines 416 418) no Hoare annotation was computed. [2019-11-25 08:58:25,090 INFO L440 ceAbstractionStarter]: At program point L383(lines 374 406) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,091 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:58:25,091 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 286) no Hoare annotation was computed. [2019-11-25 08:58:25,091 INFO L444 ceAbstractionStarter]: For program point L284-2(lines 207 546) no Hoare annotation was computed. [2019-11-25 08:58:25,091 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 555) no Hoare annotation was computed. [2019-11-25 08:58:25,091 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 566) no Hoare annotation was computed. [2019-11-25 08:58:25,091 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 577) no Hoare annotation was computed. [2019-11-25 08:58:25,092 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-11-25 08:58:25,092 INFO L440 ceAbstractionStarter]: At program point L516-1(lines 207 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= 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:58:25,092 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-25 08:58:25,092 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 322) no Hoare annotation was computed. [2019-11-25 08:58:25,092 INFO L444 ceAbstractionStarter]: For program point L318-2(lines 207 546) no Hoare annotation was computed. [2019-11-25 08:58:25,093 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 578) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-25 08:58:25,093 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-25 08:58:25,093 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 600) no Hoare annotation was computed. [2019-11-25 08:58:25,093 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 404) no Hoare annotation was computed. [2019-11-25 08:58:25,094 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 554) no Hoare annotation was computed. [2019-11-25 08:58:25,094 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 565) no Hoare annotation was computed. [2019-11-25 08:58:25,094 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 576) no Hoare annotation was computed. [2019-11-25 08:58:25,094 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-25 08:58:25,094 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 72 614) no Hoare annotation was computed. [2019-11-25 08:58:25,094 INFO L444 ceAbstractionStarter]: For program point L618(line 618) no Hoare annotation was computed. [2019-11-25 08:58:25,095 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 599) no Hoare annotation was computed. [2019-11-25 08:58:25,095 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-11-25 08:58:25,095 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 555) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-11-25 08:58:25,096 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 566) 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 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,096 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 576) 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:58:25,096 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-25 08:58:25,096 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2019-11-25 08:58:25,097 INFO L444 ceAbstractionStarter]: For program point L586-2(lines 585 599) no Hoare annotation was computed. [2019-11-25 08:58:25,097 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:58:25,097 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-25 08:58:25,097 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-11-25 08:58:25,097 INFO L444 ceAbstractionStarter]: For program point L290-2(lines 290 294) no Hoare annotation was computed. [2019-11-25 08:58:25,097 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 553) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 564) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 575) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point L588(lines 588 590) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 232) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 225 232) no Hoare annotation was computed. [2019-11-25 08:58:25,098 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:58:25,099 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-11-25 08:58:25,099 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-11-25 08:58:25,099 INFO L444 ceAbstractionStarter]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2019-11-25 08:58:25,099 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 433) no Hoare annotation was computed. [2019-11-25 08:58:25,099 INFO L444 ceAbstractionStarter]: For program point L425-2(lines 425 433) no Hoare annotation was computed. [2019-11-25 08:58:25,099 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-25 08:58:25,100 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 552) no Hoare annotation was computed. [2019-11-25 08:58:25,100 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 563) no Hoare annotation was computed. [2019-11-25 08:58:25,100 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 574) no Hoare annotation was computed. [2019-11-25 08:58:25,100 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 366) no Hoare annotation was computed. [2019-11-25 08:58:25,100 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 553) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-11-25 08:58:25,101 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 564) 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))) (.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))) (.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 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,101 INFO L444 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-11-25 08:58:25,101 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-25 08:58:25,102 INFO L440 ceAbstractionStarter]: At program point L395(lines 386 404) 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 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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:58:25,102 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 551) no Hoare annotation was computed. [2019-11-25 08:58:25,102 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 562) no Hoare annotation was computed. [2019-11-25 08:58:25,102 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 573) no Hoare annotation was computed. [2019-11-25 08:58:25,103 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 (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))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse10 .cse12 .cse13 .cse14 .cse15 .cse2 .cse16 .cse4 .cse5 .cse17 .cse18 .cse9) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse17 .cse18))) [2019-11-25 08:58:25,103 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2019-11-25 08:58:25,103 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 365) no Hoare annotation was computed. [2019-11-25 08:58:25,103 INFO L444 ceAbstractionStarter]: For program point L330-1(lines 330 365) no Hoare annotation was computed. [2019-11-25 08:58:25,104 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 562) 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))) (.cse13 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.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 .cse13)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse13 .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:58:25,104 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 575) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.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))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (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 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse13 .cse14 .cse15) (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)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13 (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)) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse12 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-25 08:58:25,104 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-25 08:58:25,105 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-25 08:58:25,105 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 207 546) no Hoare annotation was computed. [2019-11-25 08:58:25,105 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 362) no Hoare annotation was computed. [2019-11-25 08:58:25,105 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-25 08:58:25,105 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 550) no Hoare annotation was computed. [2019-11-25 08:58:25,105 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 561) no Hoare annotation was computed. [2019-11-25 08:58:25,106 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 572) no Hoare annotation was computed. [2019-11-25 08:58:25,106 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 583) no Hoare annotation was computed. [2019-11-25 08:58:25,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:58:25 BoogieIcfgContainer [2019-11-25 08:58:25,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:58:25,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:58:25,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:58:25,154 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:58:25,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:58" (3/4) ... [2019-11-25 08:58:25,158 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:58:25,174 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:58:25,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:58:25,284 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5da89a5b-59d7-4e11-994b-9ebe5e633569/bin/uautomizer/witness.graphml [2019-11-25 08:58:25,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:58:25,286 INFO L168 Benchmark]: Toolchain (without parser) took 28376.80 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 944.8 MB in the beginning and 935.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-25 08:58:25,286 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:25,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:25,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.80 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:58:25,287 INFO L168 Benchmark]: Boogie Preprocessor took 35.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:25,288 INFO L168 Benchmark]: RCFGBuilder took 842.98 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:25,288 INFO L168 Benchmark]: TraceAbstraction took 26744.32 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 946.6 MB in the end (delta: 130.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-25 08:58:25,288 INFO L168 Benchmark]: Witness Printer took 131.03 ms. Allocated memory is still 2.6 GB. Free memory was 946.6 MB in the beginning and 935.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:25,290 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 842.98 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26744.32 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 946.6 MB in the end (delta: 130.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 131.03 ms. Allocated memory is still 2.6 GB. Free memory was 946.6 MB in the beginning and 935.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 618]: 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: 140]: Loop Invariant Derived loop invariant: ((((((((((((((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)) && 2 == blastFlag) && !(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: 101]: 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: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 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)) && 2 == blastFlag) && !(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: 104]: Loop Invariant Derived loop invariant: ((!(s__state == 8448) && 2 == blastFlag) && s__state <= 8448) || ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: 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: 374]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(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: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 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)) && 2 == blastFlag) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((1 == blastFlag && !(s__state == 8513)) && !(s__state == 8512)) && 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 <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((s__state <= 3 || (((((((!(s__state == 8577) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593))) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((((((((1 == blastFlag && !(s__state == 8513)) && !(s__state == 8512)) && 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 <= 8576) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((((((0 == blastFlag && !(s__state == 8513)) && 8448 <= s__state) && !(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)) - InvariantResult [Line: 167]: 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)) || ((((((((((((((((!(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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(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 == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: 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)) || (((((((((((((((((((!(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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((!(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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && 8448 <= s__state) && s__state <= 8448)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((s__state <= 3 || (((((((!(s__state == 8577) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && 2 == blastFlag) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593))) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((((((((((((((1 == blastFlag && !(s__state == 8513)) && !(s__state == 8512)) && 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 <= 8576) && !(s__state == 8480))) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: 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: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(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: 185]: 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)) || (((((((((((((((((((((((((!(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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(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: 146]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && 2 == blastFlag) && !(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: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(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)) || (((((((((((((((((((((((((!(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 == 8544)) && !(s__state == 8529)) && !(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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && 2 == blastFlag) && !(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))) || ((((((((((((((((1 == blastFlag && 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))) || ((((((((((((((((0 == blastFlag && !(s__state == 8513)) && 8448 <= s__state) && !(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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: SAFE, OverallTime: 26.6s, OverallIterations: 40, TraceHistogramMax: 38, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.7s, HoareTripleCheckerStatistics: 6725 SDtfs, 5197 SDslu, 2367 SDs, 0 SdLazy, 3349 SolverSat, 1340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2211 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 40 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4028 HoareAnnotationTreeSize, 28 FomulaSimplifications, 35056 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7529 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 13262 NumberOfCodeBlocks, 13262 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 13218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9177165 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3245 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 86997/87153 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...