./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41b53a8be36a107d9ce8e745364368cfe44e748b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:52:45,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:52:45,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:52:45,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:52:45,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:52:45,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:52:45,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:52:45,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:52:45,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:52:45,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:52:45,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:52:45,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:52:45,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:52:45,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:52:45,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:52:45,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:52:45,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:52:45,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:52:45,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:52:45,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:52:45,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:52:45,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:52:45,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:52:45,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:52:45,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:52:45,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:52:45,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:52:45,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:52:45,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:52:45,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:52:45,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:52:45,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:52:45,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:52:45,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:52:45,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:52:45,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:52:45,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:52:45,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:52:45,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:52:45,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:52:45,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:52:45,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:52:45,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:52:45,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:52:45,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:52:45,631 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:52:45,631 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:52:45,631 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:52:45,631 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:52:45,631 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:52:45,631 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:52:45,631 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:52:45,632 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:52:45,632 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:52:45,632 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:52:45,632 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:52:45,632 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:52:45,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:52:45,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:52:45,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:52:45,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:52:45,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:52:45,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:52:45,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:52:45,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:52:45,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:52:45,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:52:45,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:52:45,636 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41b53a8be36a107d9ce8e745364368cfe44e748b [2019-12-07 12:52:45,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:52:45,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:52:45,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:52:45,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:52:45,754 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:52:45,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-12-07 12:52:45,793 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/data/d73b45a7b/f774b29006b545bda1c9e0e20872e3f8/FLAG5b9857519 [2019-12-07 12:52:46,218 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:52:46,219 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/sv-benchmarks/c/ssh-simplified/s3_srvr_8.cil.c [2019-12-07 12:52:46,229 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/data/d73b45a7b/f774b29006b545bda1c9e0e20872e3f8/FLAG5b9857519 [2019-12-07 12:52:46,240 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/data/d73b45a7b/f774b29006b545bda1c9e0e20872e3f8 [2019-12-07 12:52:46,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:52:46,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:52:46,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:52:46,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:52:46,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:52:46,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408e5454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46, skipping insertion in model container [2019-12-07 12:52:46,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:52:46,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:52:46,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:52:46,463 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:52:46,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:52:46,508 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:52:46,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46 WrapperNode [2019-12-07 12:52:46,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:52:46,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:52:46,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:52:46,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:52:46,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:52:46,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:52:46,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:52:46,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:52:46,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... [2019-12-07 12:52:46,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:52:46,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:52:46,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:52:46,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:52:46,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:52:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:52:46,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:52:46,681 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:52:46,984 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 12:52:46,985 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 12:52:47,170 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:52:47,171 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:52:47,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:52:47 BoogieIcfgContainer [2019-12-07 12:52:47,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:52:47,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:52:47,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:52:47,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:52:47,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:52:46" (1/3) ... [2019-12-07 12:52:47,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3837a1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:52:47, skipping insertion in model container [2019-12-07 12:52:47,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:46" (2/3) ... [2019-12-07 12:52:47,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3837a1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:52:47, skipping insertion in model container [2019-12-07 12:52:47,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:52:47" (3/3) ... [2019-12-07 12:52:47,176 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-12-07 12:52:47,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:52:47,188 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:52:47,195 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:52:47,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:52:47,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:52:47,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:52:47,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:52:47,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:52:47,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:52:47,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:52:47,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:52:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-12-07 12:52:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:52:47,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:47,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:47,229 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash -352734867, now seen corresponding path program 1 times [2019-12-07 12:52:47,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:47,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769215622] [2019-12-07 12:52:47,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:47,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769215622] [2019-12-07 12:52:47,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:47,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:52:47,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123480873] [2019-12-07 12:52:47,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:47,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:47,380 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-12-07 12:52:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:47,524 INFO L93 Difference]: Finished difference Result 235 states and 408 transitions. [2019-12-07 12:52:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:47,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 12:52:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:47,535 INFO L225 Difference]: With dead ends: 235 [2019-12-07 12:52:47,535 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 12:52:47,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 12:52:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-12-07 12:52:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 12:52:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2019-12-07 12:52:47,574 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 37 [2019-12-07 12:52:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:47,575 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2019-12-07 12:52:47,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2019-12-07 12:52:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:52:47,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:47,577 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:47,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash 132671285, now seen corresponding path program 1 times [2019-12-07 12:52:47,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:47,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920600969] [2019-12-07 12:52:47,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:47,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920600969] [2019-12-07 12:52:47,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:47,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:47,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531702655] [2019-12-07 12:52:47,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:47,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:47,643 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand 3 states. [2019-12-07 12:52:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:47,741 INFO L93 Difference]: Finished difference Result 261 states and 390 transitions. [2019-12-07 12:52:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:47,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 12:52:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:47,743 INFO L225 Difference]: With dead ends: 261 [2019-12-07 12:52:47,743 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 12:52:47,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 12:52:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-12-07 12:52:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-07 12:52:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-12-07 12:52:47,753 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 51 [2019-12-07 12:52:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:47,753 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-12-07 12:52:47,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-12-07 12:52:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 12:52:47,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:47,755 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:47,756 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:47,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1275337279, now seen corresponding path program 1 times [2019-12-07 12:52:47,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:47,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228688724] [2019-12-07 12:52:47,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 12:52:47,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228688724] [2019-12-07 12:52:47,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:47,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:52:47,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190420044] [2019-12-07 12:52:47,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:52:47,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:52:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:52:47,832 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 4 states. [2019-12-07 12:52:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:47,986 INFO L93 Difference]: Finished difference Result 352 states and 528 transitions. [2019-12-07 12:52:47,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:52:47,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 12:52:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:47,988 INFO L225 Difference]: With dead ends: 352 [2019-12-07 12:52:47,988 INFO L226 Difference]: Without dead ends: 214 [2019-12-07 12:52:47,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:52:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-07 12:52:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2019-12-07 12:52:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 12:52:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 271 transitions. [2019-12-07 12:52:47,999 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 271 transitions. Word has length 68 [2019-12-07 12:52:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,000 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 271 transitions. [2019-12-07 12:52:48,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:52:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 271 transitions. [2019-12-07 12:52:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 12:52:48,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,002 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,002 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -921996691, now seen corresponding path program 1 times [2019-12-07 12:52:48,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591160266] [2019-12-07 12:52:48,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 12:52:48,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591160266] [2019-12-07 12:52:48,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473161718] [2019-12-07 12:52:48,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,045 INFO L87 Difference]: Start difference. First operand 198 states and 271 transitions. Second operand 3 states. [2019-12-07 12:52:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:48,130 INFO L93 Difference]: Finished difference Result 409 states and 564 transitions. [2019-12-07 12:52:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:48,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-12-07 12:52:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:48,131 INFO L225 Difference]: With dead ends: 409 [2019-12-07 12:52:48,131 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 12:52:48,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 12:52:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-12-07 12:52:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 12:52:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 287 transitions. [2019-12-07 12:52:48,141 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 287 transitions. Word has length 77 [2019-12-07 12:52:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,142 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 287 transitions. [2019-12-07 12:52:48,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 287 transitions. [2019-12-07 12:52:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 12:52:48,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,143 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,143 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1846451617, now seen corresponding path program 1 times [2019-12-07 12:52:48,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925590454] [2019-12-07 12:52:48,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 12:52:48,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925590454] [2019-12-07 12:52:48,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120766075] [2019-12-07 12:52:48,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,189 INFO L87 Difference]: Start difference. First operand 211 states and 287 transitions. Second operand 3 states. [2019-12-07 12:52:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:48,273 INFO L93 Difference]: Finished difference Result 453 states and 630 transitions. [2019-12-07 12:52:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:48,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-12-07 12:52:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:48,275 INFO L225 Difference]: With dead ends: 453 [2019-12-07 12:52:48,275 INFO L226 Difference]: Without dead ends: 244 [2019-12-07 12:52:48,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-12-07 12:52:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 234. [2019-12-07 12:52:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 12:52:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 313 transitions. [2019-12-07 12:52:48,282 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 313 transitions. Word has length 88 [2019-12-07 12:52:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,282 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 313 transitions. [2019-12-07 12:52:48,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 313 transitions. [2019-12-07 12:52:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 12:52:48,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,283 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,283 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash 120353238, now seen corresponding path program 1 times [2019-12-07 12:52:48,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677033633] [2019-12-07 12:52:48,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 12:52:48,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677033633] [2019-12-07 12:52:48,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712850990] [2019-12-07 12:52:48,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,317 INFO L87 Difference]: Start difference. First operand 234 states and 313 transitions. Second operand 3 states. [2019-12-07 12:52:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:48,423 INFO L93 Difference]: Finished difference Result 534 states and 730 transitions. [2019-12-07 12:52:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:48,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-12-07 12:52:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:48,425 INFO L225 Difference]: With dead ends: 534 [2019-12-07 12:52:48,425 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 12:52:48,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 12:52:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-12-07 12:52:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-07 12:52:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 402 transitions. [2019-12-07 12:52:48,432 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 402 transitions. Word has length 88 [2019-12-07 12:52:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,432 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 402 transitions. [2019-12-07 12:52:48,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 402 transitions. [2019-12-07 12:52:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:52:48,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,434 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,434 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1942704014, now seen corresponding path program 1 times [2019-12-07 12:52:48,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42242705] [2019-12-07 12:52:48,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 12:52:48,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42242705] [2019-12-07 12:52:48,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105767654] [2019-12-07 12:52:48,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,474 INFO L87 Difference]: Start difference. First operand 295 states and 402 transitions. Second operand 3 states. [2019-12-07 12:52:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:48,567 INFO L93 Difference]: Finished difference Result 621 states and 858 transitions. [2019-12-07 12:52:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:48,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-12-07 12:52:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:48,569 INFO L225 Difference]: With dead ends: 621 [2019-12-07 12:52:48,569 INFO L226 Difference]: Without dead ends: 328 [2019-12-07 12:52:48,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-07 12:52:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2019-12-07 12:52:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-07 12:52:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 430 transitions. [2019-12-07 12:52:48,577 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 430 transitions. Word has length 112 [2019-12-07 12:52:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,577 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 430 transitions. [2019-12-07 12:52:48,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 430 transitions. [2019-12-07 12:52:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 12:52:48,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,578 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,578 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1594478839, now seen corresponding path program 1 times [2019-12-07 12:52:48,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025156738] [2019-12-07 12:52:48,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 12:52:48,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025156738] [2019-12-07 12:52:48,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429952393] [2019-12-07 12:52:48,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,622 INFO L87 Difference]: Start difference. First operand 320 states and 430 transitions. Second operand 3 states. [2019-12-07 12:52:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:48,731 INFO L93 Difference]: Finished difference Result 645 states and 868 transitions. [2019-12-07 12:52:48,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:48,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-12-07 12:52:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:48,734 INFO L225 Difference]: With dead ends: 645 [2019-12-07 12:52:48,734 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 12:52:48,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 12:52:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2019-12-07 12:52:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 12:52:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 432 transitions. [2019-12-07 12:52:48,745 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 432 transitions. Word has length 126 [2019-12-07 12:52:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,745 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 432 transitions. [2019-12-07 12:52:48,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 432 transitions. [2019-12-07 12:52:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 12:52:48,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,747 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash 546000958, now seen corresponding path program 1 times [2019-12-07 12:52:48,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215368518] [2019-12-07 12:52:48,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 12:52:48,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215368518] [2019-12-07 12:52:48,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666830062] [2019-12-07 12:52:48,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,793 INFO L87 Difference]: Start difference. First operand 323 states and 432 transitions. Second operand 3 states. [2019-12-07 12:52:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:48,894 INFO L93 Difference]: Finished difference Result 673 states and 911 transitions. [2019-12-07 12:52:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:48,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-12-07 12:52:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:48,896 INFO L225 Difference]: With dead ends: 673 [2019-12-07 12:52:48,896 INFO L226 Difference]: Without dead ends: 352 [2019-12-07 12:52:48,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-07 12:52:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2019-12-07 12:52:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 12:52:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2019-12-07 12:52:48,908 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 134 [2019-12-07 12:52:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:48,908 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2019-12-07 12:52:48,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2019-12-07 12:52:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 12:52:48,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:48,910 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:48,910 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1805075614, now seen corresponding path program 1 times [2019-12-07 12:52:48,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:48,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006098930] [2019-12-07 12:52:48,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 12:52:48,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006098930] [2019-12-07 12:52:48,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:48,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:48,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521366977] [2019-12-07 12:52:48,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:48,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:48,952 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand 3 states. [2019-12-07 12:52:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:49,045 INFO L93 Difference]: Finished difference Result 727 states and 973 transitions. [2019-12-07 12:52:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:49,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-12-07 12:52:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:49,048 INFO L225 Difference]: With dead ends: 727 [2019-12-07 12:52:49,048 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 12:52:49,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:52:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 12:52:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-12-07 12:52:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-07 12:52:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 494 transitions. [2019-12-07 12:52:49,059 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 494 transitions. Word has length 139 [2019-12-07 12:52:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:49,060 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 494 transitions. [2019-12-07 12:52:49,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 494 transitions. [2019-12-07 12:52:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 12:52:49,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:49,062 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:49,062 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1778409280, now seen corresponding path program 1 times [2019-12-07 12:52:49,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:49,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797648753] [2019-12-07 12:52:49,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 164 proven. 25 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 12:52:49,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797648753] [2019-12-07 12:52:49,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830910575] [2019-12-07 12:52:49,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:49,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:52:49,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-12-07 12:52:49,248 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:52:49,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-12-07 12:52:49,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:49,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4] total 8 [2019-12-07 12:52:49,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95784643] [2019-12-07 12:52:49,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:49,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:49,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:49,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:52:49,321 INFO L87 Difference]: Start difference. First operand 379 states and 494 transitions. Second operand 3 states. [2019-12-07 12:52:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:49,350 INFO L93 Difference]: Finished difference Result 755 states and 985 transitions. [2019-12-07 12:52:49,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:49,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 12:52:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:49,354 INFO L225 Difference]: With dead ends: 755 [2019-12-07 12:52:49,354 INFO L226 Difference]: Without dead ends: 753 [2019-12-07 12:52:49,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:52:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-12-07 12:52:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 687. [2019-12-07 12:52:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-12-07 12:52:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 909 transitions. [2019-12-07 12:52:49,369 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 909 transitions. Word has length 166 [2019-12-07 12:52:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:49,369 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 909 transitions. [2019-12-07 12:52:49,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 909 transitions. [2019-12-07 12:52:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 12:52:49,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:49,371 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:49,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:49,572 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1924334460, now seen corresponding path program 1 times [2019-12-07 12:52:49,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:49,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074189413] [2019-12-07 12:52:49,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 12:52:49,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074189413] [2019-12-07 12:52:49,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129148578] [2019-12-07 12:52:49,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:49,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:52:49,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 12:52:49,768 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:52:49,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 12:52:49,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:49,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2019-12-07 12:52:49,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151592955] [2019-12-07 12:52:49,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:52:49,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:52:49,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:52:49,911 INFO L87 Difference]: Start difference. First operand 687 states and 909 transitions. Second operand 7 states. [2019-12-07 12:52:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:49,994 INFO L93 Difference]: Finished difference Result 2462 states and 3246 transitions. [2019-12-07 12:52:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:52:49,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-12-07 12:52:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:50,003 INFO L225 Difference]: With dead ends: 2462 [2019-12-07 12:52:50,004 INFO L226 Difference]: Without dead ends: 1777 [2019-12-07 12:52:50,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:52:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-12-07 12:52:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1373. [2019-12-07 12:52:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-12-07 12:52:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1817 transitions. [2019-12-07 12:52:50,043 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1817 transitions. Word has length 171 [2019-12-07 12:52:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:50,043 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 1817 transitions. [2019-12-07 12:52:50,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:52:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1817 transitions. [2019-12-07 12:52:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-12-07 12:52:50,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:50,047 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:50,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:50,248 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1354232873, now seen corresponding path program 1 times [2019-12-07 12:52:50,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:50,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299877572] [2019-12-07 12:52:50,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 710 proven. 25 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-12-07 12:52:50,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299877572] [2019-12-07 12:52:50,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996914708] [2019-12-07 12:52:50,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:50,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:52:50,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 548 proven. 135 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-12-07 12:52:50,578 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:52:50,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:50,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-12-07 12:52:50,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:52:50,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4] total 8 [2019-12-07 12:52:50,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354346884] [2019-12-07 12:52:50,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:52:50,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:52:50,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:52:50,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:52:50,653 INFO L87 Difference]: Start difference. First operand 1373 states and 1817 transitions. Second operand 3 states. [2019-12-07 12:52:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:50,690 INFO L93 Difference]: Finished difference Result 2433 states and 3213 transitions. [2019-12-07 12:52:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:52:50,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-12-07 12:52:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:50,696 INFO L225 Difference]: With dead ends: 2433 [2019-12-07 12:52:50,697 INFO L226 Difference]: Without dead ends: 1748 [2019-12-07 12:52:50,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 580 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:52:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-07 12:52:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1681. [2019-12-07 12:52:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2019-12-07 12:52:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2230 transitions. [2019-12-07 12:52:50,730 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2230 transitions. Word has length 293 [2019-12-07 12:52:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:50,730 INFO L462 AbstractCegarLoop]: Abstraction has 1681 states and 2230 transitions. [2019-12-07 12:52:50,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:52:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2230 transitions. [2019-12-07 12:52:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-12-07 12:52:50,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:50,734 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:52:50,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:50,935 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1438226541, now seen corresponding path program 1 times [2019-12-07 12:52:50,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:52:50,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718864717] [2019-12-07 12:52:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 553 proven. 316 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-12-07 12:52:51,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718864717] [2019-12-07 12:52:51,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045020425] [2019-12-07 12:52:51,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:51,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:52:51,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:51,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:51,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 631 proven. 151 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-12-07 12:52:51,245 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:52:51,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 682 proven. 100 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-12-07 12:52:51,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572025931] [2019-12-07 12:52:51,347 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2019-12-07 12:52:51,347 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:52:51,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:52:51,358 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:52:51,358 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:52:54,305 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:52:54,805 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 152 [2019-12-07 12:52:55,172 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2019-12-07 12:52:55,590 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 148 [2019-12-07 12:52:55,982 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 152 [2019-12-07 12:52:56,437 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 12:52:56,902 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2019-12-07 12:52:57,405 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 161 [2019-12-07 12:52:57,901 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 152 [2019-12-07 12:52:58,418 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 12:52:58,905 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 150 [2019-12-07 12:52:59,347 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 155 [2019-12-07 12:52:59,761 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 148 [2019-12-07 12:53:00,186 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 157 [2019-12-07 12:53:00,623 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 160 [2019-12-07 12:53:01,076 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 163 [2019-12-07 12:53:01,598 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 151 [2019-12-07 12:53:02,048 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 154 [2019-12-07 12:53:02,521 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 166 [2019-12-07 12:53:03,102 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 169 [2019-12-07 12:53:03,639 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 172 [2019-12-07 12:53:04,160 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 175 [2019-12-07 12:53:04,702 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 178 [2019-12-07 12:53:05,268 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 181 [2019-12-07 12:53:05,921 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 184 [2019-12-07 12:53:06,586 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 187 [2019-12-07 12:53:07,253 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 190 [2019-12-07 12:53:07,869 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 193 [2019-12-07 12:53:08,518 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 196 [2019-12-07 12:53:09,193 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 199 [2019-12-07 12:53:09,882 WARN L192 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 202 [2019-12-07 12:53:10,571 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 205 [2019-12-07 12:53:11,322 WARN L192 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 208 [2019-12-07 12:53:12,064 WARN L192 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 211 [2019-12-07 12:53:12,812 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 214 [2019-12-07 12:53:13,623 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 217 [2019-12-07 12:53:14,411 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 220 [2019-12-07 12:53:15,121 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 151 [2019-12-07 12:53:15,889 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 153 [2019-12-07 12:53:16,620 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 165 [2019-12-07 12:53:17,262 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 166 [2019-12-07 12:53:18,113 WARN L192 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 223 [2019-12-07 12:53:18,984 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 226 [2019-12-07 12:53:19,706 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 151 [2019-12-07 12:53:20,354 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 161 [2019-12-07 12:53:20,991 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 151 [2019-12-07 12:53:21,670 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 153 [2019-12-07 12:53:22,391 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 151 [2019-12-07 12:53:23,010 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 151 [2019-12-07 12:53:23,661 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 152 [2019-12-07 12:53:24,324 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 154 [2019-12-07 12:53:24,995 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 157 [2019-12-07 12:53:24,997 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:53:24,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:53:24,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2019-12-07 12:53:24,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996074447] [2019-12-07 12:53:24,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:53:24,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:53:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:53:25,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2818, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 12:53:25,001 INFO L87 Difference]: Start difference. First operand 1681 states and 2230 transitions. Second operand 9 states. [2019-12-07 12:53:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:25,920 INFO L93 Difference]: Finished difference Result 4300 states and 5835 transitions. [2019-12-07 12:53:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:53:25,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 298 [2019-12-07 12:53:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:25,931 INFO L225 Difference]: With dead ends: 4300 [2019-12-07 12:53:25,931 INFO L226 Difference]: Without dead ends: 1905 [2019-12-07 12:53:25,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=821, Invalid=4435, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 12:53:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2019-12-07 12:53:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1518. [2019-12-07 12:53:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-12-07 12:53:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1941 transitions. [2019-12-07 12:53:25,965 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1941 transitions. Word has length 298 [2019-12-07 12:53:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:25,965 INFO L462 AbstractCegarLoop]: Abstraction has 1518 states and 1941 transitions. [2019-12-07 12:53:25,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:53:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1941 transitions. [2019-12-07 12:53:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-12-07 12:53:25,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:25,971 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1] [2019-12-07 12:53:26,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:26,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -683440743, now seen corresponding path program 1 times [2019-12-07 12:53:26,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:53:26,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252789738] [2019-12-07 12:53:26,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 1266 proven. 25 refuted. 0 times theorem prover too weak. 974 trivial. 0 not checked. [2019-12-07 12:53:26,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252789738] [2019-12-07 12:53:26,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173577840] [2019-12-07 12:53:26,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:26,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:53:26,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 1039 proven. 148 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2019-12-07 12:53:26,483 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:53:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 1187 proven. 0 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2019-12-07 12:53:26,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:53:26,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 10 [2019-12-07 12:53:26,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280904135] [2019-12-07 12:53:26,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:53:26,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:53:26,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:53:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:53:26,732 INFO L87 Difference]: Start difference. First operand 1518 states and 1941 transitions. Second operand 6 states. [2019-12-07 12:53:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:26,803 INFO L93 Difference]: Finished difference Result 3412 states and 4337 transitions. [2019-12-07 12:53:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:53:26,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 444 [2019-12-07 12:53:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:26,814 INFO L225 Difference]: With dead ends: 3412 [2019-12-07 12:53:26,814 INFO L226 Difference]: Without dead ends: 2102 [2019-12-07 12:53:26,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 881 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:53:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2019-12-07 12:53:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2100. [2019-12-07 12:53:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-07 12:53:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2686 transitions. [2019-12-07 12:53:26,865 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2686 transitions. Word has length 444 [2019-12-07 12:53:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:26,866 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2686 transitions. [2019-12-07 12:53:26,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:53:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2686 transitions. [2019-12-07 12:53:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-12-07 12:53:26,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:26,872 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-12-07 12:53:27,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:27,073 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1707070963, now seen corresponding path program 1 times [2019-12-07 12:53:27,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:53:27,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012155087] [2019-12-07 12:53:27,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1405 proven. 25 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2019-12-07 12:53:27,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012155087] [2019-12-07 12:53:27,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424525607] [2019-12-07 12:53:27,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:27,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:53:27,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1430 proven. 0 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2019-12-07 12:53:27,427 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:53:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1430 proven. 0 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2019-12-07 12:53:27,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:53:27,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 12:53:27,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58920008] [2019-12-07 12:53:27,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:27,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:53:27,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:53:27,538 INFO L87 Difference]: Start difference. First operand 2100 states and 2686 transitions. Second operand 4 states. [2019-12-07 12:53:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:27,580 INFO L93 Difference]: Finished difference Result 3621 states and 4633 transitions. [2019-12-07 12:53:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:27,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 480 [2019-12-07 12:53:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:27,587 INFO L225 Difference]: With dead ends: 3621 [2019-12-07 12:53:27,588 INFO L226 Difference]: Without dead ends: 2104 [2019-12-07 12:53:27,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:53:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2019-12-07 12:53:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2100. [2019-12-07 12:53:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-07 12:53:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2685 transitions. [2019-12-07 12:53:27,622 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2685 transitions. Word has length 480 [2019-12-07 12:53:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:27,622 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2685 transitions. [2019-12-07 12:53:27,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2685 transitions. [2019-12-07 12:53:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2019-12-07 12:53:27,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:27,626 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:27,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:27,827 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2051856060, now seen corresponding path program 2 times [2019-12-07 12:53:27,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:53:27,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043421124] [2019-12-07 12:53:27,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 1817 proven. 25 refuted. 0 times theorem prover too weak. 2119 trivial. 0 not checked. [2019-12-07 12:53:28,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043421124] [2019-12-07 12:53:28,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134203950] [2019-12-07 12:53:28,011 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:28,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 12:53:28,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:53:28,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:53:28,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 1522 proven. 173 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2019-12-07 12:53:28,298 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:53:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 1588 proven. 107 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2019-12-07 12:53:28,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1751703183] [2019-12-07 12:53:28,495 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2019-12-07 12:53:28,495 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:53:28,496 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:53:28,496 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:53:28,496 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:53:33,656 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:53:34,141 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 152 [2019-12-07 12:53:34,506 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2019-12-07 12:53:34,963 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 148 [2019-12-07 12:53:35,384 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 152 [2019-12-07 12:53:35,818 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 12:53:36,261 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2019-12-07 12:53:36,742 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 161 [2019-12-07 12:53:37,160 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 152 [2019-12-07 12:53:37,597 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 155 [2019-12-07 12:53:38,057 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 150 [2019-12-07 12:53:38,486 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 155 [2019-12-07 12:53:39,685 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 182 DAG size of output: 173 [2019-12-07 12:53:40,104 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 149 [2019-12-07 12:53:40,536 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 157 [2019-12-07 12:53:41,030 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 160 [2019-12-07 12:53:41,547 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 163 [2019-12-07 12:53:42,013 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 151 [2019-12-07 12:53:42,490 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 154 [2019-12-07 12:53:43,015 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 166 [2019-12-07 12:53:43,548 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 169 [2019-12-07 12:53:44,080 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 151 [2019-12-07 12:53:44,614 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 153 [2019-12-07 12:53:45,200 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 159 [2019-12-07 12:53:45,725 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 172 [2019-12-07 12:53:46,284 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 175 [2019-12-07 12:53:46,863 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 151 [2019-12-07 12:53:47,520 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 167 [2019-12-07 12:53:48,147 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 164 [2019-12-07 12:53:48,730 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 164 [2019-12-07 12:53:49,401 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 163 [2019-12-07 12:53:49,988 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 178 [2019-12-07 12:53:50,591 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 181 [2019-12-07 12:53:51,165 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 151 [2019-12-07 12:53:51,776 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 154 [2019-12-07 12:53:52,386 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 152 [2019-12-07 12:53:53,014 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 154 [2019-12-07 12:53:53,667 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 159 [2019-12-07 12:53:54,312 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 161 [2019-12-07 12:53:54,930 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 184 [2019-12-07 12:53:55,575 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 187 [2019-12-07 12:53:56,261 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 190 [2019-12-07 12:53:57,057 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 193 [2019-12-07 12:53:57,724 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 151 [2019-12-07 12:53:58,434 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 153 [2019-12-07 12:53:59,197 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 196 [2019-12-07 12:53:59,918 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 199 [2019-12-07 12:54:00,712 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 202 [2019-12-07 12:54:01,485 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 205 [2019-12-07 12:54:02,273 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 208 [2019-12-07 12:54:03,076 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 211 [2019-12-07 12:54:03,880 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 214 [2019-12-07 12:54:04,610 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 151 [2019-12-07 12:54:05,248 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 151 [2019-12-07 12:54:05,914 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 154 [2019-12-07 12:54:06,570 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 157 [2019-12-07 12:54:07,631 WARN L192 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 217 [2019-12-07 12:54:08,506 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 220 [2019-12-07 12:54:09,251 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 151 [2019-12-07 12:54:10,000 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 153 [2019-12-07 12:54:10,710 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 165 [2019-12-07 12:54:11,431 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 166 [2019-12-07 12:54:12,320 WARN L192 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 223 [2019-12-07 12:54:13,238 WARN L192 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 226 [2019-12-07 12:54:14,042 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 151 [2019-12-07 12:54:14,779 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 161 [2019-12-07 12:54:15,152 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:54:15,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:54:15,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2019-12-07 12:54:15,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418275306] [2019-12-07 12:54:15,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:54:15,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:54:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:54:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=4658, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 12:54:15,156 INFO L87 Difference]: Start difference. First operand 2100 states and 2685 transitions. Second operand 11 states. [2019-12-07 12:54:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:16,169 INFO L93 Difference]: Finished difference Result 2734 states and 3529 transitions. [2019-12-07 12:54:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:54:16,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 583 [2019-12-07 12:54:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:16,170 INFO L225 Difference]: With dead ends: 2734 [2019-12-07 12:54:16,170 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:54:16,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1766 GetRequests, 1681 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2680 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=1115, Invalid=5857, Unknown=0, NotChecked=0, Total=6972 [2019-12-07 12:54:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:54:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:54:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:54:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:54:16,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2019-12-07 12:54:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:16,174 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:54:16,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:54:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:54:16,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:54:16,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:16,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:54:17,058 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-12-07 12:54:18,028 WARN L192 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-12-07 12:54:18,269 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-12-07 12:54:18,736 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-12-07 12:54:19,277 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-12-07 12:54:19,423 INFO L246 CegarLoopResult]: For program point L498(lines 498 501) no Hoare annotation was computed. [2019-12-07 12:54:19,423 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-12-07 12:54:19,423 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-12-07 12:54:19,423 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L242 CegarLoopResult]: At program point L201(lines 197 569) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse3 (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse1))) [2019-12-07 12:54:19,424 INFO L249 CegarLoopResult]: At program point L631(lines 10 633) the Hoare annotation is: true [2019-12-07 12:54:19,424 INFO L242 CegarLoopResult]: At program point L565(lines 98 620) the Hoare annotation is: (let ((.cse15 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse14 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse11 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (let ((.cse1 (or .cse11 (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse12 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse4 (not .cse14)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (or .cse11 .cse15)) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (or .cse11 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse15)) (.cse7 (< ULTIMATE.start_ssl3_accept_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse3 .cse4) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (and .cse8 .cse6 .cse7 .cse9) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse2) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse6 .cse7) (and (let ((.cse10 (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (or (and (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10) (and .cse6 .cse10))) .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse11 .cse12) (and .cse1 .cse2 .cse9 .cse4) (and (or (and .cse13 .cse4) (and .cse14 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) .cse6 .cse7) (and .cse11 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse12) (and .cse8 .cse6 .cse13) (and .cse0 .cse2 .cse3 (= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4) (and .cse8 .cse0 .cse5 .cse3) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))))) [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L533-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L170(lines 170 578) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L137(lines 137 589) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L104(lines 104 600) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-12-07 12:54:19,424 INFO L242 CegarLoopResult]: At program point L171(lines 167 579) the Hoare annotation is: (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (< ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,424 INFO L242 CegarLoopResult]: At program point L138(lines 134 590) the Hoare annotation is: (or (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (or (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) [2019-12-07 12:54:19,424 INFO L246 CegarLoopResult]: For program point L602(lines 602 618) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L173(lines 173 577) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L140(lines 140 588) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L107(lines 107 599) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L603(lines 603 617) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L604(lines 604 609) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L604-2(lines 603 617) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L176(lines 176 576) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L143(lines 143 587) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L110(lines 110 598) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L606(lines 606 608) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L474(lines 474 484) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-12-07 12:54:19,425 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L242 CegarLoopResult]: At program point L210(lines 104 600) the Hoare annotation is: (let ((.cse0 (< ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0))))) [2019-12-07 12:54:19,426 INFO L242 CegarLoopResult]: At program point L177(lines 173 577) the Hoare annotation is: (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (< ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,426 INFO L242 CegarLoopResult]: At program point L144(lines 140 588) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not .cse1)) (and (let ((.cse2 (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) (or (and .cse2 .cse0) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L509-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L179(lines 179 575) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L146(lines 146 586) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L113(lines 113 597) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L477(lines 477 483) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L477-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L182(lines 182 574) no Hoare annotation was computed. [2019-12-07 12:54:19,426 INFO L246 CegarLoopResult]: For program point L149(lines 149 585) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L116(lines 116 596) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L480(lines 480 482) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L242 CegarLoopResult]: At program point L183(lines 179 575) the Hoare annotation is: (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (< ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,427 INFO L242 CegarLoopResult]: At program point L150(lines 146 586) the Hoare annotation is: (or (and (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,427 INFO L242 CegarLoopResult]: At program point L481(lines 71 632) the Hoare annotation is: false [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (or (and (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L185(lines 185 573) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L152(lines 152 584) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L119(lines 119 595) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-12-07 12:54:19,427 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2))) [2019-12-07 12:54:19,427 INFO L242 CegarLoopResult]: At program point L120(lines 116 596) the Hoare annotation is: (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,427 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L188(lines 188 572) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L155(lines 155 583) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L242 CegarLoopResult]: At program point L122(lines 122 594) the Hoare annotation is: (let ((.cse17 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse16 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse13 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (let ((.cse10 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (or .cse13 (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse14 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse15 (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse4 (not .cse16)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (or .cse13 .cse17)) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (or .cse13 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17)) (.cse7 (< ULTIMATE.start_ssl3_accept_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse3 .cse4) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (and .cse8 .cse6 .cse7 .cse9) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse2) (and .cse7 (let ((.cse11 (= ULTIMATE.start_ssl3_accept_~s__state~0 8464))) (or (and (or .cse10 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse11) (and .cse6 .cse11)))) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse6 .cse7) (and (let ((.cse12 (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (or (and .cse10 .cse12) (and .cse6 .cse12))) .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse13 .cse14) (and .cse1 .cse2 .cse9 .cse4) (and (or (and .cse15 .cse4) (and .cse16 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) .cse6 .cse7) (and .cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse14) (and .cse8 .cse6 .cse15) (and .cse0 .cse2 .cse3 (= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4) (and .cse8 .cse0 .cse5 .cse3) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))))) [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 632) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L519(lines 519 522) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-12-07 12:54:19,428 INFO L242 CegarLoopResult]: At program point L189(lines 185 573) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (or (< ULTIMATE.start_ssl3_accept_~s__state~0 8656) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not .cse0)))) [2019-12-07 12:54:19,428 INFO L242 CegarLoopResult]: At program point L156(lines 152 584) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2))) [2019-12-07 12:54:19,428 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L191(lines 191 571) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L158(lines 158 582) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L125(lines 125 593) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L249 CegarLoopResult]: At program point L621(lines 97 622) the Hoare annotation is: true [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 564) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L194(lines 194 570) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L161(lines 161 581) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L246 CegarLoopResult]: For program point L128(lines 128 592) no Hoare annotation was computed. [2019-12-07 12:54:19,429 INFO L242 CegarLoopResult]: At program point L195(lines 191 571) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse4 (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (or (= 5 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse4 .cse2) (and .cse0 (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3))) [2019-12-07 12:54:19,429 INFO L242 CegarLoopResult]: At program point L162(lines 158 582) the Hoare annotation is: (or (and (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point L197(lines 197 569) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point L164(lines 164 580) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point L131(lines 131 591) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 620) the Hoare annotation is: (let ((.cse17 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse16 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse13 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (let ((.cse10 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (or .cse13 (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse14 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse15 (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse4 (not .cse16)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (or .cse13 .cse17)) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (or .cse13 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17)) (.cse7 (< ULTIMATE.start_ssl3_accept_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse3 .cse4) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (and .cse8 .cse6 .cse7 .cse9) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse2) (and .cse7 (let ((.cse11 (= ULTIMATE.start_ssl3_accept_~s__state~0 8464))) (or (and (or .cse10 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse11) (and .cse6 .cse11)))) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse6 .cse7) (and (let ((.cse12 (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (or (and .cse10 .cse12) (and .cse6 .cse12))) .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse13 .cse14) (and .cse1 .cse2 .cse9 .cse4) (and (or (and .cse15 .cse4) (and .cse16 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) .cse6 .cse7) (and .cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse14) (and .cse8 .cse6 .cse15) (and .cse0 .cse2 .cse3 (= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4) (and .cse8 .cse0 .cse5 .cse3) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))))) [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2))) [2019-12-07 12:54:19,430 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-12-07 12:54:19,430 INFO L242 CegarLoopResult]: At program point L165(lines 164 580) the Hoare annotation is: (let ((.cse1 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (or (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse0) (and .cse1 .cse0 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (and (or .cse1 (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 12:54:19,430 INFO L242 CegarLoopResult]: At program point L132(lines 125 593) the Hoare annotation is: (or (and (or (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (or (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0) (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-12-07 12:54:19,431 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-12-07 12:54:19,431 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-12-07 12:54:19,431 INFO L242 CegarLoopResult]: At program point L200(lines 200 568) the Hoare annotation is: (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) [2019-12-07 12:54:19,431 INFO L246 CegarLoopResult]: For program point L167(lines 167 579) no Hoare annotation was computed. [2019-12-07 12:54:19,431 INFO L246 CegarLoopResult]: For program point L134(lines 134 590) no Hoare annotation was computed. [2019-12-07 12:54:19,431 INFO L242 CegarLoopResult]: At program point L101(lines 101 601) the Hoare annotation is: (let ((.cse17 (= 3 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse16 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse13 (= 4 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (let ((.cse10 (= 1 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (or .cse13 (= 7 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse14 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse15 (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse4 (not .cse16)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (or .cse13 .cse17)) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (or .cse13 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse17)) (.cse7 (< ULTIMATE.start_ssl3_accept_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse3 .cse4) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (and .cse8 .cse6 .cse7 .cse9) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse2) (and .cse7 (let ((.cse11 (= ULTIMATE.start_ssl3_accept_~s__state~0 8464))) (or (and (or .cse10 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse11) (and .cse6 .cse11)))) (and (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse6 .cse7) (and (let ((.cse12 (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (or (and .cse10 .cse12) (and .cse6 .cse12))) .cse7) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) .cse13 .cse14) (and .cse1 .cse2 .cse9 .cse4) (and (or (and .cse15 .cse4) (and .cse16 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) .cse6 .cse7) (and .cse13 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse14) (and .cse8 .cse6 .cse15) (and .cse0 .cse2 .cse3 (= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4) (and .cse8 .cse0 .cse5 .cse3) (and .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))))) [2019-12-07 12:54:19,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:54:19 BoogieIcfgContainer [2019-12-07 12:54:19,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:54:19,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:54:19,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:54:19,459 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:54:19,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:52:47" (3/4) ... [2019-12-07 12:54:19,462 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:54:19,474 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2019-12-07 12:54:19,475 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 12:54:19,475 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:54:19,556 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_13f0a7f4-971d-4b8a-9083-1985182f77ea/bin/utaipan/witness.graphml [2019-12-07 12:54:19,556 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:54:19,557 INFO L168 Benchmark]: Toolchain (without parser) took 93313.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.6 MB). Free memory was 946.2 MB in the beginning and 1.4 GB in the end (delta: -484.2 MB). Peak memory consumption was 663.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:19,557 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:54:19,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:19,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:54:19,557 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:19,557 INFO L168 Benchmark]: RCFGBuilder took 603.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.7 MB in the end (delta: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:19,558 INFO L168 Benchmark]: TraceAbstraction took 92286.65 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 401.1 MB). Free memory was 985.7 MB in the beginning and 785.6 MB in the end (delta: 200.1 MB). Peak memory consumption was 621.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:19,558 INFO L168 Benchmark]: Witness Printer took 96.74 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -32.0 MB). Free memory was 785.6 MB in the beginning and 1.4 GB in the end (delta: -644.8 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:19,559 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 603.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.7 MB in the end (delta: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92286.65 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 401.1 MB). Free memory was 985.7 MB in the beginning and 785.6 MB in the end (delta: 200.1 MB). Peak memory consumption was 621.6 MB. Max. memory is 11.5 GB. * Witness Printer took 96.74 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -32.0 MB). Free memory was 785.6 MB in the beginning and 1.4 GB in the end (delta: -644.8 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((s__state <= 8672 && (4 == blastFlag || 7 == blastFlag)) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit)) || (((s__state <= 8672 && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state) && !(0 == s__hit))) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8560)) || (((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4) && s__state <= 8640)) || (s__state == 3 && s__s3__tmp__next_state___0 <= 8640)) || (blastFlag < 4 && (((1 == blastFlag || 0 == blastFlag) && s__state == 8464) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8464)))) || ((s__state == 8544 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || (((1 == blastFlag && s__state == 8496) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8496)) && blastFlag < 4)) || ((s__state <= 3 && 4 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit))) || ((((s__state == 8656 && !(0 == s__hit)) || (0 == s__hit && s__state == 8512)) && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || ((4 == blastFlag && s__state == 8448) && 3 == s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && s__state == 8656)) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && 6 == blastFlag) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state)) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8528) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) || ((((2 == blastFlag || 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) || (((2 == blastFlag || 3 == blastFlag) && 0 == s__hit) && s__state == 8512)) && s__state <= 8576) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((s__s3__tmp__next_state___0 <= 8576 && (2 == blastFlag || 3 == blastFlag)) && s__state < 8640) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((7 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) || ((2 == blastFlag || 3 == blastFlag) && s__state <= 8576)) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((s__state < 8448 && (4 == blastFlag || 7 == blastFlag)) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state < 8448) && (2 == blastFlag || 3 == blastFlag)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8640 && 8656 <= s__state) && 6 == blastFlag) && !(0 == s__hit)) || (((7 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit))) || (((4 == blastFlag || 3 == blastFlag) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) || (((1 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state <= 8576) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((s__state <= 8672 && (4 == blastFlag || 7 == blastFlag)) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit)) || (((s__state <= 8672 && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state) && !(0 == s__hit))) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8560)) || (((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4) && s__state <= 8640)) || (s__state == 3 && s__s3__tmp__next_state___0 <= 8640)) || (blastFlag < 4 && (((1 == blastFlag || 0 == blastFlag) && s__state == 8464) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8464)))) || ((s__state == 8544 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || (((1 == blastFlag && s__state == 8496) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8496)) && blastFlag < 4)) || ((s__state <= 3 && 4 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit))) || ((((s__state == 8656 && !(0 == s__hit)) || (0 == s__hit && s__state == 8512)) && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || ((4 == blastFlag && s__state == 8448) && 3 == s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && s__state == 8656)) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && 6 == blastFlag) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state)) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8528) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((s__s3__tmp__next_state___0 <= 8576 && (2 == blastFlag || 3 == blastFlag)) && s__state < 8640) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((2 == blastFlag || 3 == blastFlag) && s__state <= 8576) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((s__s3__tmp__next_state___0 <= 8576 && (2 == blastFlag || 3 == blastFlag)) && s__state <= 8576) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && (5 == blastFlag || 6 == blastFlag)) && 8656 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && 8656 <= s__state)) || ((((s__state <= 8672 && 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit))) || (((s__state <= 8672 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && 8656 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((s__state <= 8672 && (4 == blastFlag || 7 == blastFlag)) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit)) || (((s__state <= 8672 && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state) && !(0 == s__hit))) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8560)) || (((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4) && s__state <= 8640)) || (s__state == 3 && s__s3__tmp__next_state___0 <= 8640)) || (blastFlag < 4 && (((1 == blastFlag || 0 == blastFlag) && s__state == 8464) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8464)))) || ((s__state == 8544 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || (((1 == blastFlag && s__state == 8496) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8496)) && blastFlag < 4)) || ((s__state <= 3 && 4 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit))) || ((((s__state == 8656 && !(0 == s__hit)) || (0 == s__hit && s__state == 8512)) && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || ((4 == blastFlag && s__state == 8448) && 3 == s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && s__state == 8656)) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && 6 == blastFlag) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state)) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8528) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && (2 == blastFlag || 3 == blastFlag)) && s__state == 8448) || ((4 == blastFlag && s__state == 8448) && 3 == s__s3__tmp__next_state___0)) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((7 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) || ((2 == blastFlag || 3 == blastFlag) && s__state <= 8576)) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && (2 == blastFlag || 3 == blastFlag)) && (s__state < 8656 || 0 == s__hit)) && s__state <= 8656) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: s__state <= 8672 - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((7 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) || ((2 == blastFlag || 3 == blastFlag) && s__state <= 8576)) || (((4 == blastFlag && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((s__state <= 8672 && (4 == blastFlag || 7 == blastFlag)) && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && !(0 == s__hit)) || (((s__state <= 8672 && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state) && !(0 == s__hit))) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8560)) || (((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4) && s__state <= 8640)) || (s__state == 3 && s__s3__tmp__next_state___0 <= 8640)) || ((s__state == 8544 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || (((1 == blastFlag && s__state == 8496) || (((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && s__state == 8496)) && blastFlag < 4)) || ((s__state <= 3 && 4 == blastFlag) && 3 == s__s3__tmp__next_state___0)) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit))) || ((((s__state == 8656 && !(0 == s__hit)) || (0 == s__hit && s__state == 8512)) && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && blastFlag < 4)) || ((4 == blastFlag && s__state == 8448) && 3 == s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 8576 && ((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag)) && s__state == 8656)) || ((((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8640) && 8656 <= s__state) && 6 == blastFlag) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8672) && (4 == blastFlag || 3 == blastFlag)) && 8656 <= s__state)) || ((((4 == blastFlag || 2 == blastFlag) || 3 == blastFlag) && blastFlag < 4) && s__state == 8528) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((2 == blastFlag || 3 == blastFlag) && s__state <= 8576) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((2 == blastFlag || 3 == blastFlag) && s__state <= 8576) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((s__s3__tmp__next_state___0 <= 8576 && (2 == blastFlag || 3 == blastFlag)) && s__state < 8640) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((1 == blastFlag || 0 == blastFlag) || 2 == blastFlag) || 3 == blastFlag) && s__state <= 8576) || ((((4 == blastFlag || 7 == blastFlag) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: SAFE, OverallTime: 89.1s, OverallIterations: 17, TraceHistogramMax: 19, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 3290 SDtfs, 2627 SDslu, 3720 SDs, 0 SdLazy, 3379 SolverSat, 591 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5836 GetRequests, 5628 SyntacticMatches, 11 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 73.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 979 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 301 NumberOfFragments, 1862 HoareAnnotationTreeSize, 26 FomulaSimplifications, 11851 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 5463 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 5790 NumberOfCodeBlocks, 5383 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 8194 ConstructedInterpolants, 0 QuantifiedInterpolants, 5965926 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3271 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 33629/35535 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...