./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/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 64a8f3377d83624025022bfde8edd1f829e70f73 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:45:07,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:07,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:07,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:07,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:07,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:07,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:07,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:07,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:07,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:07,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:07,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:07,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:07,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:07,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:07,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:07,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:07,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:07,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:07,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:07,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:07,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:07,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:07,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:07,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:07,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:07,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:07,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:07,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:07,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:07,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:07,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:07,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:07,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:07,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:07,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:07,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:07,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:07,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:07,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:07,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:07,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:45:07,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:07,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:07,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:07,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:07,356 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:07,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:07,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:07,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:07,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:07,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:07,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:45:07,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:07,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:45:07,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:07,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:07,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:07,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:45:07,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:07,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:07,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:07,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:07,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:07,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:07,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:07,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:45:07,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:07,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:45:07,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:45:07,363 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_0125b421-d392-4339-83b5-53a183285bdd/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 -> 64a8f3377d83624025022bfde8edd1f829e70f73 [2019-11-15 23:45:07,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:07,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:07,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:07,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:07,412 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:07,413 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-11-15 23:45:07,466 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/data/57466a23a/749551216adc4069a553966cfc2483f3/FLAG9f77f3256 [2019-11-15 23:45:07,890 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:07,907 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/sv-benchmarks/c/ssh-simplified/s3_srvr_4.cil.c [2019-11-15 23:45:07,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/data/57466a23a/749551216adc4069a553966cfc2483f3/FLAG9f77f3256 [2019-11-15 23:45:08,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/data/57466a23a/749551216adc4069a553966cfc2483f3 [2019-11-15 23:45:08,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:08,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:08,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:08,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:08,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:08,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fe9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08, skipping insertion in model container [2019-11-15 23:45:08,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,300 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:08,335 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:08,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:08,624 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:08,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:08,696 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:08,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08 WrapperNode [2019-11-15 23:45:08,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:08,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:08,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:08,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:08,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:08,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:08,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:08,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:08,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... [2019-11-15 23:45:08,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:08,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:08,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:08,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:08,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/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-15 23:45:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:08,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:08,983 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:45:09,704 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 23:45:09,705 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 23:45:09,706 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:09,706 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:45:09,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:09 BoogieIcfgContainer [2019-11-15 23:45:09,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:09,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:45:09,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:45:09,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:45:09,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:08" (1/3) ... [2019-11-15 23:45:09,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:09, skipping insertion in model container [2019-11-15 23:45:09,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:08" (2/3) ... [2019-11-15 23:45:09,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:09, skipping insertion in model container [2019-11-15 23:45:09,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:09" (3/3) ... [2019-11-15 23:45:09,723 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-11-15 23:45:09,731 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:45:09,741 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:45:09,751 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:45:09,792 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:45:09,792 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:45:09,792 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:45:09,792 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:09,793 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:09,793 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:45:09,793 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:09,793 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:45:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-15 23:45:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:45:09,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:09,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:09,829 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-15 23:45:09,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:09,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081646219] [2019-11-15 23:45:09,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:10,108 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-15 23:45:10,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081646219] [2019-11-15 23:45:10,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:10,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:10,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379663499] [2019-11-15 23:45:10,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:10,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:10,129 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-15 23:45:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:10,434 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-15 23:45:10,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:10,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 23:45:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:10,455 INFO L225 Difference]: With dead ends: 327 [2019-11-15 23:45:10,455 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 23:45:10,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 23:45:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-15 23:45:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 23:45:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-15 23:45:10,512 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-15 23:45:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:10,512 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-15 23:45:10,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-15 23:45:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:45:10,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:10,515 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:10,515 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-15 23:45:10,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:10,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557918420] [2019-11-15 23:45:10,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:10,587 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-15 23:45:10,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557918420] [2019-11-15 23:45:10,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:10,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:10,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870470776] [2019-11-15 23:45:10,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:10,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:10,591 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-15 23:45:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:10,833 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-15 23:45:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:10,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 23:45:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:10,837 INFO L225 Difference]: With dead ends: 379 [2019-11-15 23:45:10,837 INFO L226 Difference]: Without dead ends: 215 [2019-11-15 23:45:10,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-15 23:45:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-15 23:45:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 23:45:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-15 23:45:10,872 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-15 23:45:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:10,873 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-15 23:45:10,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-15 23:45:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 23:45:10,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:10,877 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:10,877 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-11-15 23:45:10,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:10,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334921522] [2019-11-15 23:45:10,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:10,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:10,997 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-15 23:45:10,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334921522] [2019-11-15 23:45:10,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:10,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:10,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247821796] [2019-11-15 23:45:10,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:11,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,000 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-15 23:45:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:11,192 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-15 23:45:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:11,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 23:45:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:11,195 INFO L225 Difference]: With dead ends: 444 [2019-11-15 23:45:11,195 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 23:45:11,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 23:45:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-15 23:45:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-15 23:45:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-15 23:45:11,216 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-15 23:45:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:11,217 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-15 23:45:11,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-15 23:45:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:45:11,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:11,221 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:11,222 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-11-15 23:45:11,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:11,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621505440] [2019-11-15 23:45:11,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:11,270 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-15 23:45:11,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621505440] [2019-11-15 23:45:11,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:11,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:11,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901153320] [2019-11-15 23:45:11,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:11,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,273 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-15 23:45:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:11,427 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-15 23:45:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:11,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 23:45:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:11,429 INFO L225 Difference]: With dead ends: 492 [2019-11-15 23:45:11,429 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 23:45:11,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 23:45:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-15 23:45:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-15 23:45:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-15 23:45:11,464 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-15 23:45:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:11,464 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-15 23:45:11,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-15 23:45:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:45:11,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:11,473 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:11,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-11-15 23:45:11,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:11,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187797258] [2019-11-15 23:45:11,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:11,523 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-15 23:45:11,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187797258] [2019-11-15 23:45:11,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:11,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:11,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043090977] [2019-11-15 23:45:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:11,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,525 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-15 23:45:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:11,724 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-11-15 23:45:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:11,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 23:45:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:11,727 INFO L225 Difference]: With dead ends: 552 [2019-11-15 23:45:11,727 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 23:45:11,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 23:45:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-11-15 23:45:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 23:45:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-15 23:45:11,743 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-15 23:45:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:11,744 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-15 23:45:11,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-15 23:45:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:45:11,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:11,746 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:11,747 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-11-15 23:45:11,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:11,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855177854] [2019-11-15 23:45:11,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:11,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:11,826 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-15 23:45:11,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855177854] [2019-11-15 23:45:11,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:11,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:11,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989583697] [2019-11-15 23:45:11,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:11,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,828 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-15 23:45:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:11,981 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-15 23:45:11,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:11,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 23:45:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:11,984 INFO L225 Difference]: With dead ends: 591 [2019-11-15 23:45:11,984 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 23:45:11,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 23:45:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-15 23:45:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 23:45:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-15 23:45:12,006 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-15 23:45:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:12,009 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-15 23:45:12,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-15 23:45:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 23:45:12,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:12,018 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:12,019 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-11-15 23:45:12,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323127757] [2019-11-15 23:45:12,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:12,087 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-15 23:45:12,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323127757] [2019-11-15 23:45:12,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:12,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:12,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103608675] [2019-11-15 23:45:12,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:12,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,090 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-15 23:45:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:12,277 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-11-15 23:45:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:12,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 23:45:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:12,280 INFO L225 Difference]: With dead ends: 594 [2019-11-15 23:45:12,280 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 23:45:12,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 23:45:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-11-15 23:45:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-15 23:45:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-15 23:45:12,292 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-15 23:45:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:12,292 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-15 23:45:12,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-15 23:45:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:45:12,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:12,294 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:12,294 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-11-15 23:45:12,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304889768] [2019-11-15 23:45:12,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:12,354 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-15 23:45:12,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304889768] [2019-11-15 23:45:12,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:12,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:12,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863841506] [2019-11-15 23:45:12,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:12,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:12,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,357 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-15 23:45:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:12,472 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-15 23:45:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:12,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 23:45:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:12,474 INFO L225 Difference]: With dead ends: 594 [2019-11-15 23:45:12,475 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 23:45:12,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 23:45:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-15 23:45:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-15 23:45:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-15 23:45:12,489 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-15 23:45:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:12,489 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-15 23:45:12,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-15 23:45:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:45:12,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:12,491 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:12,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-11-15 23:45:12,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354977061] [2019-11-15 23:45:12,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:12,529 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-15 23:45:12,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354977061] [2019-11-15 23:45:12,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:12,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:12,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2318432] [2019-11-15 23:45:12,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:12,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,531 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-15 23:45:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:12,690 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-15 23:45:12,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:12,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 23:45:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:12,693 INFO L225 Difference]: With dead ends: 634 [2019-11-15 23:45:12,693 INFO L226 Difference]: Without dead ends: 336 [2019-11-15 23:45:12,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-15 23:45:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-15 23:45:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 23:45:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-15 23:45:12,706 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-15 23:45:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:12,706 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-15 23:45:12,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-15 23:45:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:45:12,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:12,708 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:12,708 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:12,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-11-15 23:45:12,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221041670] [2019-11-15 23:45:12,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:12,743 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-15 23:45:12,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221041670] [2019-11-15 23:45:12,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:12,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:12,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579254345] [2019-11-15 23:45:12,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:12,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,746 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-15 23:45:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:12,900 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-15 23:45:12,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:12,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 23:45:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:12,902 INFO L225 Difference]: With dead ends: 663 [2019-11-15 23:45:12,903 INFO L226 Difference]: Without dead ends: 336 [2019-11-15 23:45:12,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-15 23:45:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-15 23:45:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 23:45:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-15 23:45:12,917 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-15 23:45:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:12,918 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-15 23:45:12,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-15 23:45:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:45:12,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:12,920 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:12,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-11-15 23:45:12,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:12,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076637302] [2019-11-15 23:45:12,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:12,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:12,977 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-15 23:45:12,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076637302] [2019-11-15 23:45:12,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:12,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:12,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071223121] [2019-11-15 23:45:12,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:12,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:12,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:12,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:12,980 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-15 23:45:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:13,136 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-15 23:45:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:13,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 23:45:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:13,138 INFO L225 Difference]: With dead ends: 696 [2019-11-15 23:45:13,139 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 23:45:13,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 23:45:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-15 23:45:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 23:45:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-15 23:45:13,152 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-15 23:45:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:13,152 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-15 23:45:13,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-15 23:45:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 23:45:13,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:13,154 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:13,155 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-11-15 23:45:13,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:13,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085837846] [2019-11-15 23:45:13,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:13,189 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-15 23:45:13,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085837846] [2019-11-15 23:45:13,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:13,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:13,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22720816] [2019-11-15 23:45:13,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:13,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,191 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-15 23:45:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:13,334 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-15 23:45:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:13,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-15 23:45:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:13,337 INFO L225 Difference]: With dead ends: 723 [2019-11-15 23:45:13,337 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 23:45:13,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 23:45:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-15 23:45:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 23:45:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-15 23:45:13,353 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-15 23:45:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:13,353 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-15 23:45:13,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-15 23:45:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:45:13,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:13,357 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:13,357 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-11-15 23:45:13,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:13,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005213386] [2019-11-15 23:45:13,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:13,409 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-15 23:45:13,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005213386] [2019-11-15 23:45:13,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:13,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:13,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923306715] [2019-11-15 23:45:13,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:13,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:13,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,412 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-15 23:45:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:13,583 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-11-15 23:45:13,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:13,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 23:45:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:13,586 INFO L225 Difference]: With dead ends: 740 [2019-11-15 23:45:13,586 INFO L226 Difference]: Without dead ends: 386 [2019-11-15 23:45:13,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-15 23:45:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-15 23:45:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 23:45:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-15 23:45:13,602 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-15 23:45:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:13,602 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-15 23:45:13,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-15 23:45:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 23:45:13,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:13,605 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:13,605 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-11-15 23:45:13,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:13,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32421165] [2019-11-15 23:45:13,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:13,640 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-15 23:45:13,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32421165] [2019-11-15 23:45:13,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:13,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:13,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404314847] [2019-11-15 23:45:13,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:13,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,642 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-15 23:45:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:13,781 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-11-15 23:45:13,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:13,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 23:45:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:13,784 INFO L225 Difference]: With dead ends: 761 [2019-11-15 23:45:13,784 INFO L226 Difference]: Without dead ends: 386 [2019-11-15 23:45:13,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-15 23:45:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-11-15 23:45:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 23:45:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-15 23:45:13,799 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-15 23:45:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:13,799 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-15 23:45:13,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-15 23:45:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 23:45:13,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:13,801 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:13,801 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-11-15 23:45:13,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:13,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860571299] [2019-11-15 23:45:13,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:13,849 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-15 23:45:13,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860571299] [2019-11-15 23:45:13,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:13,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:13,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433015938] [2019-11-15 23:45:13,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:13,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,852 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-15 23:45:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:13,897 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-15 23:45:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:13,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 23:45:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:13,903 INFO L225 Difference]: With dead ends: 757 [2019-11-15 23:45:13,904 INFO L226 Difference]: Without dead ends: 755 [2019-11-15 23:45:13,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-15 23:45:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-15 23:45:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-15 23:45:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-15 23:45:13,934 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-15 23:45:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:13,935 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-15 23:45:13,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-15 23:45:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:45:13,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:13,937 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:13,937 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-11-15 23:45:13,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:13,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342414090] [2019-11-15 23:45:13,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:13,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:13,989 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-15 23:45:13,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342414090] [2019-11-15 23:45:13,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:13,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:13,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054517977] [2019-11-15 23:45:13,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:13,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:13,997 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-15 23:45:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:14,044 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-11-15 23:45:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:14,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 23:45:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:14,051 INFO L225 Difference]: With dead ends: 1831 [2019-11-15 23:45:14,051 INFO L226 Difference]: Without dead ends: 1083 [2019-11-15 23:45:14,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-15 23:45:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-11-15 23:45:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-11-15 23:45:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-11-15 23:45:14,091 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-11-15 23:45:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:14,092 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-11-15 23:45:14,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-11-15 23:45:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:45:14,095 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:14,095 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:14,095 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-11-15 23:45:14,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:14,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70866801] [2019-11-15 23:45:14,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 23:45:14,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70866801] [2019-11-15 23:45:14,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:14,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:14,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590511023] [2019-11-15 23:45:14,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:14,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,131 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-11-15 23:45:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:14,192 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-11-15 23:45:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:14,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 23:45:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:14,201 INFO L225 Difference]: With dead ends: 2528 [2019-11-15 23:45:14,201 INFO L226 Difference]: Without dead ends: 1452 [2019-11-15 23:45:14,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-15 23:45:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-11-15 23:45:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-11-15 23:45:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-11-15 23:45:14,254 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-11-15 23:45:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:14,255 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-11-15 23:45:14,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-11-15 23:45:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:45:14,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:14,258 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:14,258 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-11-15 23:45:14,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:14,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905484928] [2019-11-15 23:45:14,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 23:45:14,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905484928] [2019-11-15 23:45:14,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:14,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:45:14,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045639143] [2019-11-15 23:45:14,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:14,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:14,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,290 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-11-15 23:45:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:14,359 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-11-15 23:45:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:14,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 23:45:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:14,370 INFO L225 Difference]: With dead ends: 3248 [2019-11-15 23:45:14,370 INFO L226 Difference]: Without dead ends: 1803 [2019-11-15 23:45:14,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-11-15 23:45:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-11-15 23:45:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-15 23:45:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-11-15 23:45:14,438 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-11-15 23:45:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:14,438 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-11-15 23:45:14,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-11-15 23:45:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 23:45:14,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:14,444 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:14,445 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-11-15 23:45:14,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:14,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936702520] [2019-11-15 23:45:14,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 23:45:14,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936702520] [2019-11-15 23:45:14,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:14,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:14,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793928532] [2019-11-15 23:45:14,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:14,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:14,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:14,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,514 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-11-15 23:45:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:14,730 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-11-15 23:45:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:14,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-15 23:45:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:14,742 INFO L225 Difference]: With dead ends: 3649 [2019-11-15 23:45:14,742 INFO L226 Difference]: Without dead ends: 1853 [2019-11-15 23:45:14,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-15 23:45:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-11-15 23:45:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-15 23:45:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-11-15 23:45:14,821 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-11-15 23:45:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:14,821 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-11-15 23:45:14,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-11-15 23:45:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 23:45:14,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:14,828 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 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, 1, 1, 1, 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-15 23:45:14,828 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-11-15 23:45:14,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:14,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33032550] [2019-11-15 23:45:14,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:14,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 23:45:14,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33032550] [2019-11-15 23:45:14,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:14,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:14,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035764836] [2019-11-15 23:45:14,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:14,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:14,939 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-11-15 23:45:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:15,169 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-11-15 23:45:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:15,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-15 23:45:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:15,181 INFO L225 Difference]: With dead ends: 3666 [2019-11-15 23:45:15,181 INFO L226 Difference]: Without dead ends: 1870 [2019-11-15 23:45:15,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-15 23:45:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-11-15 23:45:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-11-15 23:45:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-11-15 23:45:15,251 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-11-15 23:45:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:15,251 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-11-15 23:45:15,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-11-15 23:45:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 23:45:15,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:15,257 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:15,257 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-11-15 23:45:15,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:15,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105860575] [2019-11-15 23:45:15,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:15,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:15,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 23:45:15,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105860575] [2019-11-15 23:45:15,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342795591] [2019-11-15 23:45:15,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/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-15 23:45:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:15,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:45:15,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-15 23:45:15,530 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:45:15,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:45:15,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802105513] [2019-11-15 23:45:15,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:15,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:15,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:15,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:15,532 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-11-15 23:45:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:15,923 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-11-15 23:45:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:45:15,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-15 23:45:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:15,937 INFO L225 Difference]: With dead ends: 4264 [2019-11-15 23:45:15,938 INFO L226 Difference]: Without dead ends: 2435 [2019-11-15 23:45:15,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 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-15 23:45:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-11-15 23:45:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-11-15 23:45:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-11-15 23:45:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-11-15 23:45:16,010 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-11-15 23:45:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:16,010 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-11-15 23:45:16,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-11-15 23:45:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 23:45:16,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:16,016 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:16,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:16,221 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-11-15 23:45:16,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:16,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841831191] [2019-11-15 23:45:16,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:16,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:16,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-15 23:45:16,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841831191] [2019-11-15 23:45:16,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:16,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:16,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135368180] [2019-11-15 23:45:16,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:16,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:16,309 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-11-15 23:45:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:16,571 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-11-15 23:45:16,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:16,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-15 23:45:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:16,582 INFO L225 Difference]: With dead ends: 3394 [2019-11-15 23:45:16,582 INFO L226 Difference]: Without dead ends: 1678 [2019-11-15 23:45:16,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-11-15 23:45:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-11-15 23:45:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-11-15 23:45:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-11-15 23:45:16,651 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-11-15 23:45:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:16,652 INFO L462 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-11-15 23:45:16,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-11-15 23:45:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 23:45:16,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:16,657 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:45:16,657 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-11-15 23:45:16,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:16,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281512280] [2019-11-15 23:45:16,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:16,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:16,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 23:45:16,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281512280] [2019-11-15 23:45:16,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330052542] [2019-11-15 23:45:16,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/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-15 23:45:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:16,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:45:16,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 23:45:16,927 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:45:16,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:45:16,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166088152] [2019-11-15 23:45:16,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:16,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:16,929 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-11-15 23:45:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:17,323 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-11-15 23:45:17,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:45:17,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-15 23:45:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:17,343 INFO L225 Difference]: With dead ends: 5319 [2019-11-15 23:45:17,343 INFO L226 Difference]: Without dead ends: 3648 [2019-11-15 23:45:17,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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-15 23:45:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-11-15 23:45:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-11-15 23:45:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-11-15 23:45:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-11-15 23:45:17,440 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-11-15 23:45:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:17,440 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-11-15 23:45:17,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-11-15 23:45:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 23:45:17,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:17,446 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:45:17,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:17,658 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-11-15 23:45:17,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:17,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679635803] [2019-11-15 23:45:17,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:17,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:17,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 23:45:17,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679635803] [2019-11-15 23:45:17,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:17,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:17,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82590464] [2019-11-15 23:45:17,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:17,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:17,756 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-11-15 23:45:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:17,886 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-11-15 23:45:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:17,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-15 23:45:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:17,926 INFO L225 Difference]: With dead ends: 5741 [2019-11-15 23:45:17,926 INFO L226 Difference]: Without dead ends: 3745 [2019-11-15 23:45:17,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-15 23:45:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-11-15 23:45:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-15 23:45:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-11-15 23:45:18,111 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-11-15 23:45:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:18,111 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-11-15 23:45:18,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-11-15 23:45:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-15 23:45:18,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:18,122 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:18,122 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:18,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-11-15 23:45:18,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:18,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273805127] [2019-11-15 23:45:18,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 23:45:18,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273805127] [2019-11-15 23:45:18,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:18,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:18,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663634383] [2019-11-15 23:45:18,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:18,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,263 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-11-15 23:45:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:18,529 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-11-15 23:45:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:18,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-15 23:45:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:18,538 INFO L225 Difference]: With dead ends: 7697 [2019-11-15 23:45:18,538 INFO L226 Difference]: Without dead ends: 3961 [2019-11-15 23:45:18,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-11-15 23:45:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-11-15 23:45:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-11-15 23:45:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-11-15 23:45:18,718 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-11-15 23:45:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:18,719 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-11-15 23:45:18,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-11-15 23:45:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-15 23:45:18,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:18,729 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 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-15 23:45:18,729 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:18,729 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-11-15 23:45:18,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:18,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132839870] [2019-11-15 23:45:18,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-15 23:45:18,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132839870] [2019-11-15 23:45:18,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:18,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:18,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581754187] [2019-11-15 23:45:18,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:18,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:18,822 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-11-15 23:45:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,044 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-11-15 23:45:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-11-15 23:45:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,051 INFO L225 Difference]: With dead ends: 7611 [2019-11-15 23:45:19,052 INFO L226 Difference]: Without dead ends: 3875 [2019-11-15 23:45:19,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-11-15 23:45:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-11-15 23:45:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-11-15 23:45:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-11-15 23:45:19,195 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-11-15 23:45:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,195 INFO L462 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-11-15 23:45:19,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-11-15 23:45:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 23:45:19,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,206 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:45:19,207 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-11-15 23:45:19,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670056786] [2019-11-15 23:45:19,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-11-15 23:45:19,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670056786] [2019-11-15 23:45:19,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466062529] [2019-11-15 23:45:19,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,312 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-11-15 23:45:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,541 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-11-15 23:45:19,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-15 23:45:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,550 INFO L225 Difference]: With dead ends: 8043 [2019-11-15 23:45:19,550 INFO L226 Difference]: Without dead ends: 4215 [2019-11-15 23:45:19,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-11-15 23:45:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-11-15 23:45:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-11-15 23:45:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-11-15 23:45:19,679 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-11-15 23:45:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:19,679 INFO L462 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-11-15 23:45:19,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-11-15 23:45:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-15 23:45:19,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:19,690 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:19,690 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-11-15 23:45:19,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:19,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154995042] [2019-11-15 23:45:19,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:19,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-15 23:45:19,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154995042] [2019-11-15 23:45:19,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:19,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:19,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825293524] [2019-11-15 23:45:19,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:19,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,793 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-11-15 23:45:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,957 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-11-15 23:45:19,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:19,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-15 23:45:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:19,962 INFO L225 Difference]: With dead ends: 6854 [2019-11-15 23:45:19,962 INFO L226 Difference]: Without dead ends: 2132 [2019-11-15 23:45:19,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-15 23:45:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-11-15 23:45:20,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-15 23:45:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-11-15 23:45:20,029 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-11-15 23:45:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,029 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-11-15 23:45:20,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-11-15 23:45:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-15 23:45:20,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,038 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:45:20,038 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-11-15 23:45:20,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883713510] [2019-11-15 23:45:20,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-11-15 23:45:20,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883713510] [2019-11-15 23:45:20,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326421247] [2019-11-15 23:45:20,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,148 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-11-15 23:45:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,307 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-11-15 23:45:20,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-15 23:45:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,312 INFO L225 Difference]: With dead ends: 4297 [2019-11-15 23:45:20,312 INFO L226 Difference]: Without dead ends: 2172 [2019-11-15 23:45:20,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-11-15 23:45:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-11-15 23:45:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-15 23:45:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-11-15 23:45:20,376 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-11-15 23:45:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,377 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-11-15 23:45:20,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-11-15 23:45:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-15 23:45:20,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,386 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:45:20,386 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-11-15 23:45:20,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119711408] [2019-11-15 23:45:20,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-15 23:45:20,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119711408] [2019-11-15 23:45:20,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:20,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:20,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094720398] [2019-11-15 23:45:20,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:20,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:20,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,548 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-11-15 23:45:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:20,732 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-11-15 23:45:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:20,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-15 23:45:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,737 INFO L225 Difference]: With dead ends: 4267 [2019-11-15 23:45:20,737 INFO L226 Difference]: Without dead ends: 2142 [2019-11-15 23:45:20,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-11-15 23:45:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-11-15 23:45:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-15 23:45:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-11-15 23:45:20,842 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-11-15 23:45:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,843 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-11-15 23:45:20,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-11-15 23:45:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-15 23:45:20,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,852 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 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, 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-15 23:45:20,852 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-11-15 23:45:20,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:20,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837855449] [2019-11-15 23:45:20,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:20,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-15 23:45:20,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837855449] [2019-11-15 23:45:20,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250837397] [2019-11-15 23:45:21,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/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-15 23:45:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:45:21,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-15 23:45:21,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:45:21,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:45:21,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977902674] [2019-11-15 23:45:21,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:21,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:21,293 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 3 states. [2019-11-15 23:45:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:21,350 INFO L93 Difference]: Finished difference Result 2710 states and 3447 transitions. [2019-11-15 23:45:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:21,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-15 23:45:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:21,356 INFO L225 Difference]: With dead ends: 2710 [2019-11-15 23:45:21,356 INFO L226 Difference]: Without dead ends: 2572 [2019-11-15 23:45:21,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 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-15 23:45:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-15 23:45:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1996. [2019-11-15 23:45:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-15 23:45:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2539 transitions. [2019-11-15 23:45:21,418 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2539 transitions. Word has length 392 [2019-11-15 23:45:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:21,419 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 2539 transitions. [2019-11-15 23:45:21,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2539 transitions. [2019-11-15 23:45:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-15 23:45:21,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:21,428 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:21,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:21,640 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:21,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1194864871, now seen corresponding path program 1 times [2019-11-15 23:45:21,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:21,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784326279] [2019-11-15 23:45:21,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:21,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-15 23:45:21,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784326279] [2019-11-15 23:45:21,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698444622] [2019-11-15 23:45:21,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/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-15 23:45:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:21,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:45:21,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-11-15 23:45:22,080 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:45:22,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:45:22,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234679143] [2019-11-15 23:45:22,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:22,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:22,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:22,085 INFO L87 Difference]: Start difference. First operand 1996 states and 2539 transitions. Second operand 4 states. [2019-11-15 23:45:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:22,461 INFO L93 Difference]: Finished difference Result 5015 states and 6403 transitions. [2019-11-15 23:45:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:45:22,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-15 23:45:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:22,466 INFO L225 Difference]: With dead ends: 5015 [2019-11-15 23:45:22,467 INFO L226 Difference]: Without dead ends: 2984 [2019-11-15 23:45:22,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 410 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-15 23:45:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2019-11-15 23:45:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2156. [2019-11-15 23:45:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-11-15 23:45:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-11-15 23:45:22,541 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 408 [2019-11-15 23:45:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:22,542 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-11-15 23:45:22,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-11-15 23:45:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-11-15 23:45:22,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:22,555 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:45:22,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:22,766 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-11-15 23:45:22,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:22,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804495884] [2019-11-15 23:45:22,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:22,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-11-15 23:45:22,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804495884] [2019-11-15 23:45:22,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:22,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:22,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284417778] [2019-11-15 23:45:22,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:22,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:22,941 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-11-15 23:45:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:23,113 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-11-15 23:45:23,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:23,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-11-15 23:45:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:23,118 INFO L225 Difference]: With dead ends: 4485 [2019-11-15 23:45:23,118 INFO L226 Difference]: Without dead ends: 2336 [2019-11-15 23:45:23,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-11-15 23:45:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-11-15 23:45:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-11-15 23:45:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-11-15 23:45:23,185 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-11-15 23:45:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:23,186 INFO L462 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-11-15 23:45:23,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-11-15 23:45:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-15 23:45:23,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:23,192 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:23,192 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-11-15 23:45:23,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:23,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800221972] [2019-11-15 23:45:23,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-11-15 23:45:23,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800221972] [2019-11-15 23:45:23,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:23,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:23,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679010220] [2019-11-15 23:45:23,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:23,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:23,484 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-11-15 23:45:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:23,663 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-11-15 23:45:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:23,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-11-15 23:45:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:23,669 INFO L225 Difference]: With dead ends: 4640 [2019-11-15 23:45:23,669 INFO L226 Difference]: Without dead ends: 2321 [2019-11-15 23:45:23,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-11-15 23:45:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-11-15 23:45:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-15 23:45:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-11-15 23:45:23,736 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-11-15 23:45:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:23,736 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-11-15 23:45:23,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-11-15 23:45:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-11-15 23:45:23,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:23,744 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 23:45:23,744 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-11-15 23:45:23,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:23,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192200230] [2019-11-15 23:45:23,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:23,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-15 23:45:24,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192200230] [2019-11-15 23:45:24,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068735092] [2019-11-15 23:45:24,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:24,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:45:24,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-15 23:45:24,408 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:45:24,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:45:24,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180977849] [2019-11-15 23:45:24,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:24,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:24,411 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-11-15 23:45:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:24,612 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-11-15 23:45:24,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:24,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-11-15 23:45:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:24,614 INFO L225 Difference]: With dead ends: 3916 [2019-11-15 23:45:24,614 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:45:24,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 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-15 23:45:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:45:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:45:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:45:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:45:24,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-11-15 23:45:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:24,619 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:45:24,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:45:24,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:45:24,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:24,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:45:25,888 WARN L191 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-15 23:45:26,955 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 211 [2019-11-15 23:45:27,499 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-11-15 23:45:27,958 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-15 23:45:28,364 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-15 23:45:28,656 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-11-15 23:45:28,895 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 24 [2019-11-15 23:45:29,279 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-11-15 23:45:31,586 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 177 DAG size of output: 104 [2019-11-15 23:45:31,828 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-11-15 23:45:32,178 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 44 [2019-11-15 23:45:32,354 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-15 23:45:32,511 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 25 [2019-11-15 23:45:32,740 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-15 23:45:32,976 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 23:45:33,226 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-15 23:45:33,464 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2019-11-15 23:45:33,739 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-15 23:45:35,706 WARN L191 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 177 DAG size of output: 104 [2019-11-15 23:45:35,983 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-15 23:45:36,169 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-11-15 23:45:36,329 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2019-11-15 23:45:36,520 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-15 23:45:36,522 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-15 23:45:36,522 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-15 23:45:36,522 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-11-15 23:45:36,522 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1) (and .cse2 .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-15 23:45:36,523 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L446 ceAbstractionStarter]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L443 ceAbstractionStarter]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-11-15 23:45:36,523 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 23:45:36,524 INFO L439 ceAbstractionStarter]: At program point L171(lines 167 556) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-15 23:45:36,524 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8)) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7) (and .cse9 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7) .cse8 .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-15 23:45:36,524 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-11-15 23:45:36,524 INFO L439 ceAbstractionStarter]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 23:45:36,524 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-15 23:45:36,524 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-15 23:45:36,524 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-15 23:45:36,525 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-15 23:45:36,526 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-15 23:45:36,526 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-11-15 23:45:36,526 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-15 23:45:36,526 INFO L439 ceAbstractionStarter]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (and (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) .cse2)) (and (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse0 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2)))) [2019-11-15 23:45:36,526 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 554) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-15 23:45:36,526 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 565) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse10 .cse9) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10))) [2019-11-15 23:45:36,527 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-15 23:45:36,527 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-11-15 23:45:36,527 INFO L446 ceAbstractionStarter]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-15 23:45:36,527 INFO L439 ceAbstractionStarter]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse17 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse20 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse16 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse30 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse31 (not .cse24)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse25 (and .cse0 (and .cse5 .cse30 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13))) (.cse23 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse26 (and .cse0 (and .cse30 .cse16 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse29 .cse13))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (and .cse30 .cse6 .cse7 .cse31 .cse8 .cse9 .cse20 .cse10 .cse11 .cse29 .cse13)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse17)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse18 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse1) (and .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse17) (and .cse17 .cse20 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse14 .cse15 .cse20 .cse18 .cse3) (and .cse21 .cse20 .cse12 .cse17) (and .cse21 .cse22 .cse19 .cse17) (and .cse21 .cse16 .cse12) (and .cse21 .cse19 .cse23 .cse17) (and .cse24 .cse17 .cse20) (and .cse14 .cse5 .cse15 .cse18) (and .cse0 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse22 .cse25) (and .cse23 .cse25) (and .cse23 .cse26) (and .cse22 .cse26) (and .cse16 .cse4) (and .cse14 .cse27 .cse28 .cse21) (and .cse4 .cse20) (and .cse14 .cse15 .cse21 .cse20 .cse18) (and .cse19 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse14 .cse27 .cse28 .cse3) (and (and .cse1 .cse29 .cse18) .cse3) (and .cse27 .cse0 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse16 .cse29 .cse18) (and .cse21 .cse5 .cse12))))) [2019-11-15 23:45:36,527 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-15 23:45:36,527 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-15 23:45:36,527 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-15 23:45:36,528 INFO L439 ceAbstractionStarter]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-15 23:45:36,529 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0))) [2019-11-15 23:45:36,529 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10))) [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-15 23:45:36,529 INFO L443 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-15 23:45:36,530 INFO L439 ceAbstractionStarter]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10))) [2019-11-15 23:45:36,530 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:45:36,530 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-15 23:45:36,530 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-15 23:45:36,530 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-15 23:45:36,530 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-11-15 23:45:36,530 INFO L439 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and (and .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-15 23:45:36,530 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse4 .cse3 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9))) [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L286-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L320-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-15 23:45:36,531 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-15 23:45:36,532 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-15 23:45:36,532 INFO L443 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-15 23:45:36,532 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-11-15 23:45:36,532 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse5 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4) (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse6))) [2019-11-15 23:45:36,532 INFO L439 ceAbstractionStarter]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and (and .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-15 23:45:36,532 INFO L439 ceAbstractionStarter]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10))) [2019-11-15 23:45:36,532 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-15 23:45:36,532 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 490) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L446 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 23:45:36,533 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 498) no Hoare annotation was computed. [2019-11-15 23:45:36,534 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse2) (and .cse0 .cse1 .cse3 .cse2 (not .cse4)))) [2019-11-15 23:45:36,534 INFO L439 ceAbstractionStarter]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8)) (and (and .cse8 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse0) (and (and (and .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7) .cse8) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-15 23:45:36,535 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-15 23:45:36,535 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-11-15 23:45:36,535 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-15 23:45:36,535 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-15 23:45:36,538 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-15 23:45:36,538 INFO L439 ceAbstractionStarter]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (let ((.cse17 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse20 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse16 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse30 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse31 (not .cse24)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse25 (and .cse0 (and .cse5 .cse30 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13))) (.cse23 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse26 (and .cse0 (and .cse30 .cse16 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse29 .cse13))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse19 (and .cse30 .cse6 .cse7 .cse31 .cse8 .cse9 .cse20 .cse10 .cse11 .cse29 .cse13)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse28 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (not .cse17)) (.cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse18 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse1) (and .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse17) (and .cse17 .cse20 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse14 .cse15 .cse20 .cse18 .cse3) (and .cse21 .cse20 .cse12 .cse17) (and .cse21 .cse22 .cse19 .cse17) (and .cse21 .cse16 .cse12) (and .cse21 .cse19 .cse23 .cse17) (and .cse24 .cse17 .cse20) (and .cse14 .cse5 .cse15 .cse18) (and .cse0 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (and .cse22 .cse25) (and .cse23 .cse25) (and .cse23 .cse26) (and .cse22 .cse26) (and .cse16 .cse4) (and .cse14 .cse27 .cse28 .cse21) (and .cse4 .cse20) (and .cse14 .cse15 .cse21 .cse20 .cse18) (and .cse19 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse14 .cse27 .cse28 .cse3) (and (and .cse1 .cse29 .cse18) .cse3) (and .cse27 .cse0 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse16 .cse29 .cse18) (and .cse21 .cse5 .cse12))))) [2019-11-15 23:45:36,538 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-15 23:45:36,538 INFO L443 ceAbstractionStarter]: For program point L495-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 23:45:36,539 INFO L439 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and (and .cse1 .cse2 .cse3 .cse4 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse5 .cse6 .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-11-15 23:45:36,539 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-15 23:45:36,539 INFO L439 ceAbstractionStarter]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)) (and .cse0 .cse3 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2))) [2019-11-15 23:45:36,539 INFO L439 ceAbstractionStarter]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10))) [2019-11-15 23:45:36,540 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:45:36,540 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-15 23:45:36,540 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-15 23:45:36,540 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-11-15 23:45:36,540 INFO L443 ceAbstractionStarter]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-11-15 23:45:36,540 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-15 23:45:36,541 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-15 23:45:36,541 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-15 23:45:36,541 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-15 23:45:36,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:45:36 BoogieIcfgContainer [2019-11-15 23:45:36,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:45:36,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:45:36,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:45:36,583 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:45:36,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:09" (3/4) ... [2019-11-15 23:45:36,587 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:45:36,603 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:45:36,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:45:36,708 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0125b421-d392-4339-83b5-53a183285bdd/bin/uautomizer/witness.graphml [2019-11-15 23:45:36,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:45:36,710 INFO L168 Benchmark]: Toolchain (without parser) took 28427.55 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 951.4 MB in the beginning and 1.6 GB in the end (delta: -642.0 MB). Peak memory consumption was 594.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:36,710 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:36,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:36,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.32 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-15 23:45:36,711 INFO L168 Benchmark]: Boogie Preprocessor took 49.64 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-15 23:45:36,711 INFO L168 Benchmark]: RCFGBuilder took 905.14 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:36,712 INFO L168 Benchmark]: TraceAbstraction took 26873.72 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -524.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:45:36,712 INFO L168 Benchmark]: Witness Printer took 125.91 ms. Allocated memory is still 2.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:36,714 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.32 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 49.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 905.14 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: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26873.72 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -524.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 125.91 ms. Allocated memory is still 2.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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 == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) || ((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) || ((8448 <= s__state && ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((((((((((!(s__state == 8560) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((s__s3__tmp__next_state___0 <= 8576 && (blastFlag == 1 && !(s__state == 8448)) && s__state <= 8448) || ((((0 == s__hit && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8448)) || (s__s3__tmp__next_state___0 <= 8576 && (0 == blastFlag && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && 0 == blastFlag) && !(s__state == 12292)) || (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292)) && !(0 == s__hit))) || ((8672 <= s__state && blastFlag == 1) && !(s__state == 12292))) || (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((s__state <= 8576 && (((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480))) || ((((s__s3__tmp__next_state___0 <= 8576 && ((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) || (s__state <= 3 && 0 == blastFlag)) || (((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((s__state <= 8672 && !(s__state == 8657)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && s__state == 8528) && 0 == s__hit)) || ((0 == s__hit && 2 == blastFlag) && 8560 == s__state)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && 0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && 8608 == s__state) && 0 == s__hit)) || ((s__state == 8544 && 0 == s__hit) && 2 == blastFlag)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((8448 <= s__state && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (s__state == 8592 && 8448 <= s__state && (((((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (8608 == s__state && 8448 <= s__state && (((((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (8608 == s__state && 8448 <= s__state && ((((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8640) && !(s__state == 8480))) || (s__state == 8592 && 8448 <= s__state && ((((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8640) && !(s__state == 8480))) || (blastFlag == 1 && s__state <= 3)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (s__state <= 3 && 2 == blastFlag)) || ((((s__state <= 8672 && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && 0 == s__hit) && s__state == 8512)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((s__state <= 8576 && (((((((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && 8448 <= s__state) || ((8448 <= s__state && ((((((0 == blastFlag && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((((((((((!(s__state == 8545) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) || ((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576)) || (((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) || ((((s__state <= 8672 && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && 8640 <= s__state)) || ((((s__state <= 8672 && !(s__state == 8672)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((s__state <= 8672 && !(s__state == 8672)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((0 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((8448 <= s__state && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && s__state <= 8448)) || (((8448 <= s__state && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) || (((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) || ((8448 <= s__state && ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((((((((((!(s__state == 8560) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && blastFlag == 1) && !(s__state == 8656)) && 8640 <= s__state) || (((((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8656)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8656)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && 2 == blastFlag) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) || ((8448 <= s__state && ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((((((((((!(s__state == 8560) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit)) || (s__state <= 3 && 0 == blastFlag)) || (((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((((s__state <= 8672 && !(s__state == 8657)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && s__state == 8528) && 0 == s__hit)) || ((0 == s__hit && 2 == blastFlag) && 8560 == s__state)) || ((((s__state <= 8672 && !(s__state == 8657)) && 2 == blastFlag) && 8640 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8576 && 2 == blastFlag) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && 0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && 8608 == s__state) && 0 == s__hit)) || ((s__state == 8544 && 0 == s__hit) && 2 == blastFlag)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8640 <= s__state)) || ((((((((8448 <= s__state && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (s__state == 8592 && 8448 <= s__state && (((((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (8608 == s__state && 8448 <= s__state && (((((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480))) || (8608 == s__state && 8448 <= s__state && ((((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8640) && !(s__state == 8480))) || (s__state == 8592 && 8448 <= s__state && ((((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8640) && !(s__state == 8480))) || (blastFlag == 1 && s__state <= 3)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (s__state <= 3 && 2 == blastFlag)) || ((((s__state <= 8672 && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && 8640 <= s__state)) || ((((((((((((!(s__state == 8560) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) && 0 == s__hit) && s__state == 8512)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((blastFlag == 1 && 8608 == s__state) || (((8608 == s__state && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (0 == blastFlag && 8608 == s__state) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480))) || (((((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 26.7s, OverallIterations: 35, TraceHistogramMax: 19, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, HoareTripleCheckerStatistics: 6655 SDtfs, 4128 SDslu, 3144 SDs, 0 SdLazy, 3455 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 4500 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3619 HoareAnnotationTreeSize, 28 FomulaSimplifications, 145052 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 38425 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 9209 NumberOfCodeBlocks, 9209 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9169 ConstructedInterpolants, 0 QuantifiedInterpolants, 3945115 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2970 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 30536/30750 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...