./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:23:17,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:23:17,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:23:17,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:23:17,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:23:17,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:23:17,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:23:17,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:23:17,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:23:17,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:23:17,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:23:17,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:23:17,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:23:17,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:23:17,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:23:17,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:23:17,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:23:17,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:23:17,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:23:17,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:23:17,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:23:17,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:23:17,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:23:17,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:23:17,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:23:17,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:23:17,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:23:17,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:23:17,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:23:17,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:23:17,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:23:17,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:23:17,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:23:17,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:23:17,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:23:17,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:23:17,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:23:17,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:23:17,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:23:17,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:23:17,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:23:17,977 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:23:18,033 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:23:18,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:23:18,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:23:18,036 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:23:18,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:23:18,036 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:23:18,036 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:23:18,036 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:23:18,043 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:23:18,043 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:23:18,043 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:23:18,043 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:23:18,044 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:23:18,044 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:23:18,044 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:23:18,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:23:18,045 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:23:18,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:23:18,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:23:18,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:23:18,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:23:18,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:23:18,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:23:18,047 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:23:18,047 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:23:18,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:23:18,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:23:18,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:23:18,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:23:18,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:23:18,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:23:18,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:23:18,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:23:18,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:23:18,050 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:23:18,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:23:18,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:23:18,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:23:18,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:23:18,051 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8 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(reach_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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2021-11-07 02:23:18,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:23:18,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:23:18,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:23:18,339 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:23:18,340 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:23:18,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-07 02:23:18,412 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/data/96a841195/43e2c902e75e4da382747c93c9ecbe23/FLAGe04722b6a [2021-11-07 02:23:18,942 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:23:18,943 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-07 02:23:18,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/data/96a841195/43e2c902e75e4da382747c93c9ecbe23/FLAGe04722b6a [2021-11-07 02:23:19,253 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/data/96a841195/43e2c902e75e4da382747c93c9ecbe23 [2021-11-07 02:23:19,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:23:19,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:23:19,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:23:19,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:23:19,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:23:19,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:19,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32aac733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19, skipping insertion in model container [2021-11-07 02:23:19,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:19,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:23:19,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:23:19,537 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-07 02:23:19,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:23:19,651 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:23:19,667 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-07 02:23:19,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:23:19,804 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:23:19,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19 WrapperNode [2021-11-07 02:23:19,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:23:19,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:23:19,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:23:19,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:23:19,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:19,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:19,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:23:19,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:23:19,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:23:19,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:23:20,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:23:20,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:23:20,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:23:20,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:23:20,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (1/1) ... [2021-11-07 02:23:20,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:23:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:20,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:23:20,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:23:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:23:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:23:20,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:23:20,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:23:20,505 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,552 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,557 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,569 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,586 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,590 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,599 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,604 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,606 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,625 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,630 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,632 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,651 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,654 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,655 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,659 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,661 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,667 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,670 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,675 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,683 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:20,686 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:23:21,903 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##674: assume !false; [2021-11-07 02:23:21,903 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##673: assume false; [2021-11-07 02:23:21,903 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##618: assume !false; [2021-11-07 02:23:21,904 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##617: assume false; [2021-11-07 02:23:21,904 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##296: assume !false; [2021-11-07 02:23:21,904 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##295: assume false; [2021-11-07 02:23:21,904 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##256: assume !false; [2021-11-07 02:23:21,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##255: assume false; [2021-11-07 02:23:21,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##217: assume !false; [2021-11-07 02:23:21,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##216: assume false; [2021-11-07 02:23:21,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##247: assume !false; [2021-11-07 02:23:21,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume false; [2021-11-07 02:23:21,906 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##724: assume !false; [2021-11-07 02:23:21,906 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##723: assume false; [2021-11-07 02:23:21,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-11-07 02:23:21,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-11-07 02:23:21,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##326: assume !false; [2021-11-07 02:23:21,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume false; [2021-11-07 02:23:21,908 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##335: assume !false; [2021-11-07 02:23:21,908 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume false; [2021-11-07 02:23:21,908 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##405: assume !false; [2021-11-07 02:23:21,908 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume false; [2021-11-07 02:23:21,909 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##412: assume false; [2021-11-07 02:23:21,909 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##413: assume !false; [2021-11-07 02:23:21,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##452: assume false; [2021-11-07 02:23:21,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##453: assume !false; [2021-11-07 02:23:21,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##483: assume !false; [2021-11-07 02:23:21,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##482: assume false; [2021-11-07 02:23:21,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##543: assume !false; [2021-11-07 02:23:21,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##542: assume false; [2021-11-07 02:23:21,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##98: assume !false; [2021-11-07 02:23:21,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume false; [2021-11-07 02:23:21,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume !false; [2021-11-07 02:23:21,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##172: assume !false; [2021-11-07 02:23:21,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume false; [2021-11-07 02:23:21,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2021-11-07 02:23:21,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2021-11-07 02:23:21,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: assume false; [2021-11-07 02:23:21,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##142: assume !false; [2021-11-07 02:23:21,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume false; [2021-11-07 02:23:21,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-07 02:23:21,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-07 02:23:21,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-11-07 02:23:21,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-11-07 02:23:23,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:23:23,116 INFO L299 CfgBuilder]: Removed 267 assume(true) statements. [2021-11-07 02:23:23,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:23:23 BoogieIcfgContainer [2021-11-07 02:23:23,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:23:23,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:23:23,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:23:23,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:23:23,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:23:19" (1/3) ... [2021-11-07 02:23:23,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a7c9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:23:23, skipping insertion in model container [2021-11-07 02:23:23,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:19" (2/3) ... [2021-11-07 02:23:23,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a7c9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:23:23, skipping insertion in model container [2021-11-07 02:23:23,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:23:23" (3/3) ... [2021-11-07 02:23:23,130 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-11-07 02:23:23,139 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:23:23,139 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2021-11-07 02:23:23,205 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:23:23,215 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:23:23,216 INFO L340 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2021-11-07 02:23:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 312 states have (on average 1.7435897435897436) internal successors, (544), 363 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 02:23:23,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:23,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 02:23:23,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:23,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:23,271 INFO L85 PathProgramCache]: Analyzing trace with hash 116517462, now seen corresponding path program 1 times [2021-11-07 02:23:23,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:23,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136344286] [2021-11-07 02:23:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:23,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:23,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:23,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136344286] [2021-11-07 02:23:23,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136344286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:23,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:23,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:23,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617220380] [2021-11-07 02:23:23,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:23,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:23,569 INFO L87 Difference]: Start difference. First operand has 364 states, 312 states have (on average 1.7435897435897436) internal successors, (544), 363 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:23,935 INFO L93 Difference]: Finished difference Result 757 states and 1133 transitions. [2021-11-07 02:23:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-07 02:23:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:23,965 INFO L225 Difference]: With dead ends: 757 [2021-11-07 02:23:23,965 INFO L226 Difference]: Without dead ends: 428 [2021-11-07 02:23:23,973 INFO L786 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 [2021-11-07 02:23:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-07 02:23:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2021-11-07 02:23:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 380 states have (on average 1.513157894736842) internal successors, (575), 419 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 575 transitions. [2021-11-07 02:23:24,094 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 575 transitions. Word has length 6 [2021-11-07 02:23:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:24,094 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 575 transitions. [2021-11-07 02:23:24,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 575 transitions. [2021-11-07 02:23:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:23:24,097 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:24,098 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:24,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:23:24,098 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1927424465, now seen corresponding path program 1 times [2021-11-07 02:23:24,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:24,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313916214] [2021-11-07 02:23:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:24,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:24,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:24,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313916214] [2021-11-07 02:23:24,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313916214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:24,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:24,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:23:24,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945984546] [2021-11-07 02:23:24,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:24,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:24,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:24,187 INFO L87 Difference]: Start difference. First operand 420 states and 575 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:24,345 INFO L93 Difference]: Finished difference Result 442 states and 600 transitions. [2021-11-07 02:23:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:24,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 02:23:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:24,348 INFO L225 Difference]: With dead ends: 442 [2021-11-07 02:23:24,348 INFO L226 Difference]: Without dead ends: 420 [2021-11-07 02:23:24,349 INFO L786 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 [2021-11-07 02:23:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-11-07 02:23:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2021-11-07 02:23:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 380 states have (on average 1.5105263157894737) internal successors, (574), 419 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 574 transitions. [2021-11-07 02:23:24,371 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 574 transitions. Word has length 10 [2021-11-07 02:23:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:24,371 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 574 transitions. [2021-11-07 02:23:24,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 574 transitions. [2021-11-07 02:23:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:23:24,373 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:24,373 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:24,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:23:24,374 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1848847082, now seen corresponding path program 1 times [2021-11-07 02:23:24,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:24,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171569040] [2021-11-07 02:23:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:24,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:24,505 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:24,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171569040] [2021-11-07 02:23:24,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171569040] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:24,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:24,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:24,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648873246] [2021-11-07 02:23:24,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:24,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:24,511 INFO L87 Difference]: Start difference. First operand 420 states and 574 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:24,576 INFO L93 Difference]: Finished difference Result 838 states and 1150 transitions. [2021-11-07 02:23:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 02:23:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:24,580 INFO L225 Difference]: With dead ends: 838 [2021-11-07 02:23:24,580 INFO L226 Difference]: Without dead ends: 528 [2021-11-07 02:23:24,582 INFO L786 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 [2021-11-07 02:23:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-07 02:23:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 437. [2021-11-07 02:23:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 407 states have (on average 1.5061425061425062) internal successors, (613), 436 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 613 transitions. [2021-11-07 02:23:24,602 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 613 transitions. Word has length 10 [2021-11-07 02:23:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:24,602 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 613 transitions. [2021-11-07 02:23:24,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 613 transitions. [2021-11-07 02:23:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:23:24,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:24,606 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:24,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:23:24,606 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1198560619, now seen corresponding path program 1 times [2021-11-07 02:23:24,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:24,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051877348] [2021-11-07 02:23:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:24,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:24,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:24,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051877348] [2021-11-07 02:23:24,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051877348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:24,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:24,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:24,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546162748] [2021-11-07 02:23:24,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:24,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:24,722 INFO L87 Difference]: Start difference. First operand 437 states and 613 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:24,838 INFO L93 Difference]: Finished difference Result 437 states and 613 transitions. [2021-11-07 02:23:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:23:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:24,846 INFO L225 Difference]: With dead ends: 437 [2021-11-07 02:23:24,846 INFO L226 Difference]: Without dead ends: 433 [2021-11-07 02:23:24,847 INFO L786 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 [2021-11-07 02:23:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-11-07 02:23:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2021-11-07 02:23:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 405 states have (on average 1.5037037037037038) internal successors, (609), 432 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 609 transitions. [2021-11-07 02:23:24,867 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 609 transitions. Word has length 15 [2021-11-07 02:23:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:24,870 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 609 transitions. [2021-11-07 02:23:24,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 609 transitions. [2021-11-07 02:23:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:23:24,876 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:24,877 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:24,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:23:24,877 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -849382793, now seen corresponding path program 1 times [2021-11-07 02:23:24,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:24,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338242261] [2021-11-07 02:23:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:24,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:24,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:24,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338242261] [2021-11-07 02:23:24,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338242261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:24,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:24,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:24,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262119669] [2021-11-07 02:23:24,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:24,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:24,945 INFO L87 Difference]: Start difference. First operand 433 states and 609 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:25,078 INFO L93 Difference]: Finished difference Result 455 states and 635 transitions. [2021-11-07 02:23:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:25,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:23:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:25,082 INFO L225 Difference]: With dead ends: 455 [2021-11-07 02:23:25,082 INFO L226 Difference]: Without dead ends: 450 [2021-11-07 02:23:25,083 INFO L786 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 [2021-11-07 02:23:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-11-07 02:23:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2021-11-07 02:23:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 419 states have (on average 1.4988066825775657) internal successors, (628), 446 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 628 transitions. [2021-11-07 02:23:25,101 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 628 transitions. Word has length 15 [2021-11-07 02:23:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:25,101 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 628 transitions. [2021-11-07 02:23:25,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 628 transitions. [2021-11-07 02:23:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 02:23:25,103 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:25,103 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:25,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:23:25,104 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -848827688, now seen corresponding path program 1 times [2021-11-07 02:23:25,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:25,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113582228] [2021-11-07 02:23:25,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:25,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:25,199 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:25,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113582228] [2021-11-07 02:23:25,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113582228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:25,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:25,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:25,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463033898] [2021-11-07 02:23:25,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:25,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:25,202 INFO L87 Difference]: Start difference. First operand 447 states and 628 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:25,361 INFO L93 Difference]: Finished difference Result 458 states and 637 transitions. [2021-11-07 02:23:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 02:23:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:25,364 INFO L225 Difference]: With dead ends: 458 [2021-11-07 02:23:25,365 INFO L226 Difference]: Without dead ends: 450 [2021-11-07 02:23:25,365 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-11-07 02:23:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2021-11-07 02:23:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 419 states have (on average 1.496420047732697) internal successors, (627), 446 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 627 transitions. [2021-11-07 02:23:25,387 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 627 transitions. Word has length 15 [2021-11-07 02:23:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:25,388 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 627 transitions. [2021-11-07 02:23:25,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 627 transitions. [2021-11-07 02:23:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:23:25,389 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:25,389 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:25,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:23:25,390 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1792507426, now seen corresponding path program 1 times [2021-11-07 02:23:25,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:25,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435990602] [2021-11-07 02:23:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:25,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:25,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:25,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435990602] [2021-11-07 02:23:25,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435990602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:25,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:25,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:25,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190000254] [2021-11-07 02:23:25,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:25,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:25,447 INFO L87 Difference]: Start difference. First operand 447 states and 627 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:25,493 INFO L93 Difference]: Finished difference Result 739 states and 1045 transitions. [2021-11-07 02:23:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:23:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:25,497 INFO L225 Difference]: With dead ends: 739 [2021-11-07 02:23:25,497 INFO L226 Difference]: Without dead ends: 385 [2021-11-07 02:23:25,498 INFO L786 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 [2021-11-07 02:23:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-07 02:23:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2021-11-07 02:23:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 363 states have (on average 1.462809917355372) internal successors, (531), 384 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 531 transitions. [2021-11-07 02:23:25,540 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 531 transitions. Word has length 16 [2021-11-07 02:23:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:25,540 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 531 transitions. [2021-11-07 02:23:25,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 531 transitions. [2021-11-07 02:23:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 02:23:25,541 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:25,541 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:25,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:23:25,542 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -560687335, now seen corresponding path program 1 times [2021-11-07 02:23:25,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:25,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037448298] [2021-11-07 02:23:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:25,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:25,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:25,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037448298] [2021-11-07 02:23:25,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037448298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:25,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:25,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:25,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941691038] [2021-11-07 02:23:25,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:25,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:25,594 INFO L87 Difference]: Start difference. First operand 385 states and 531 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:25,753 INFO L93 Difference]: Finished difference Result 396 states and 540 transitions. [2021-11-07 02:23:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 02:23:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:25,756 INFO L225 Difference]: With dead ends: 396 [2021-11-07 02:23:25,756 INFO L226 Difference]: Without dead ends: 388 [2021-11-07 02:23:25,757 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-07 02:23:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2021-11-07 02:23:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 363 states have (on average 1.4600550964187329) internal successors, (530), 384 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 530 transitions. [2021-11-07 02:23:25,783 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 530 transitions. Word has length 16 [2021-11-07 02:23:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:25,784 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 530 transitions. [2021-11-07 02:23:25,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 530 transitions. [2021-11-07 02:23:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:23:25,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:25,785 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:25,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:23:25,786 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash -212819231, now seen corresponding path program 1 times [2021-11-07 02:23:25,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:25,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61412097] [2021-11-07 02:23:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:25,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:25,828 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:25,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61412097] [2021-11-07 02:23:25,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61412097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:25,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:25,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:25,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191871665] [2021-11-07 02:23:25,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:25,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:25,835 INFO L87 Difference]: Start difference. First operand 385 states and 530 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:25,871 INFO L93 Difference]: Finished difference Result 409 states and 559 transitions. [2021-11-07 02:23:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 02:23:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:25,876 INFO L225 Difference]: With dead ends: 409 [2021-11-07 02:23:25,876 INFO L226 Difference]: Without dead ends: 378 [2021-11-07 02:23:25,877 INFO L786 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 [2021-11-07 02:23:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-11-07 02:23:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2021-11-07 02:23:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 357 states have (on average 1.4509803921568627) internal successors, (518), 377 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 518 transitions. [2021-11-07 02:23:25,914 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 518 transitions. Word has length 17 [2021-11-07 02:23:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:25,915 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 518 transitions. [2021-11-07 02:23:25,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2021-11-07 02:23:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 02:23:25,916 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:25,916 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:25,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:23:25,917 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1992909950, now seen corresponding path program 1 times [2021-11-07 02:23:25,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:25,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417308286] [2021-11-07 02:23:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:25,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:25,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:25,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417308286] [2021-11-07 02:23:25,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417308286] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:25,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:25,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:25,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019737714] [2021-11-07 02:23:25,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:25,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:25,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:25,961 INFO L87 Difference]: Start difference. First operand 378 states and 518 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:25,993 INFO L93 Difference]: Finished difference Result 391 states and 530 transitions. [2021-11-07 02:23:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 02:23:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:25,996 INFO L225 Difference]: With dead ends: 391 [2021-11-07 02:23:25,997 INFO L226 Difference]: Without dead ends: 376 [2021-11-07 02:23:25,997 INFO L786 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 [2021-11-07 02:23:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-11-07 02:23:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2021-11-07 02:23:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.4507042253521127) internal successors, (515), 375 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 515 transitions. [2021-11-07 02:23:26,020 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 515 transitions. Word has length 18 [2021-11-07 02:23:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:26,020 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 515 transitions. [2021-11-07 02:23:26,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 515 transitions. [2021-11-07 02:23:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:23:26,021 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:26,022 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:26,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:23:26,022 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash 485153018, now seen corresponding path program 1 times [2021-11-07 02:23:26,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:26,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762221811] [2021-11-07 02:23:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:26,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:26,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:26,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762221811] [2021-11-07 02:23:26,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762221811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:26,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:26,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:26,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598770445] [2021-11-07 02:23:26,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:26,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:26,069 INFO L87 Difference]: Start difference. First operand 376 states and 515 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:26,106 INFO L93 Difference]: Finished difference Result 470 states and 614 transitions. [2021-11-07 02:23:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:23:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:26,111 INFO L225 Difference]: With dead ends: 470 [2021-11-07 02:23:26,111 INFO L226 Difference]: Without dead ends: 307 [2021-11-07 02:23:26,112 INFO L786 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 [2021-11-07 02:23:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-07 02:23:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2021-11-07 02:23:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 273 states have (on average 1.3772893772893773) internal successors, (376), 293 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 376 transitions. [2021-11-07 02:23:26,132 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 376 transitions. Word has length 19 [2021-11-07 02:23:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:26,132 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 376 transitions. [2021-11-07 02:23:26,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 376 transitions. [2021-11-07 02:23:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:23:26,133 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:26,134 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:26,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:23:26,134 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash 416106724, now seen corresponding path program 1 times [2021-11-07 02:23:26,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:26,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388334457] [2021-11-07 02:23:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:26,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:26,181 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:26,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388334457] [2021-11-07 02:23:26,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388334457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:26,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:26,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:26,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197278918] [2021-11-07 02:23:26,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:26,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:26,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:26,183 INFO L87 Difference]: Start difference. First operand 294 states and 376 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:26,354 INFO L93 Difference]: Finished difference Result 449 states and 578 transitions. [2021-11-07 02:23:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 02:23:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:26,357 INFO L225 Difference]: With dead ends: 449 [2021-11-07 02:23:26,357 INFO L226 Difference]: Without dead ends: 441 [2021-11-07 02:23:26,358 INFO L786 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 [2021-11-07 02:23:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-11-07 02:23:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 304. [2021-11-07 02:23:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 283 states have (on average 1.3674911660777385) internal successors, (387), 303 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 387 transitions. [2021-11-07 02:23:26,377 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 387 transitions. Word has length 20 [2021-11-07 02:23:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:26,379 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 387 transitions. [2021-11-07 02:23:26,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 387 transitions. [2021-11-07 02:23:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:23:26,380 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:26,380 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:26,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:23:26,381 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2112070836, now seen corresponding path program 1 times [2021-11-07 02:23:26,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:26,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617347893] [2021-11-07 02:23:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:26,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:26,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:26,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617347893] [2021-11-07 02:23:26,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617347893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:26,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:26,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:26,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010790278] [2021-11-07 02:23:26,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:26,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:26,419 INFO L87 Difference]: Start difference. First operand 304 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:26,545 INFO L93 Difference]: Finished difference Result 515 states and 667 transitions. [2021-11-07 02:23:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 02:23:26,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:26,548 INFO L225 Difference]: With dead ends: 515 [2021-11-07 02:23:26,548 INFO L226 Difference]: Without dead ends: 310 [2021-11-07 02:23:26,549 INFO L786 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 [2021-11-07 02:23:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-07 02:23:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2021-11-07 02:23:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 291 states have (on average 1.3573883161512028) internal successors, (395), 309 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 395 transitions. [2021-11-07 02:23:26,569 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 395 transitions. Word has length 20 [2021-11-07 02:23:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:26,570 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 395 transitions. [2021-11-07 02:23:26,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 395 transitions. [2021-11-07 02:23:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:23:26,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:26,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:26,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:23:26,571 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash 31998246, now seen corresponding path program 1 times [2021-11-07 02:23:26,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:26,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442989308] [2021-11-07 02:23:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:26,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:26,606 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:26,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442989308] [2021-11-07 02:23:26,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442989308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:26,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:26,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:26,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014725031] [2021-11-07 02:23:26,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:26,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:26,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:26,608 INFO L87 Difference]: Start difference. First operand 310 states and 395 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:26,817 INFO L93 Difference]: Finished difference Result 455 states and 585 transitions. [2021-11-07 02:23:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 02:23:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:26,820 INFO L225 Difference]: With dead ends: 455 [2021-11-07 02:23:26,820 INFO L226 Difference]: Without dead ends: 447 [2021-11-07 02:23:26,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-11-07 02:23:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 310. [2021-11-07 02:23:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 291 states have (on average 1.3539518900343643) internal successors, (394), 309 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 394 transitions. [2021-11-07 02:23:26,844 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 394 transitions. Word has length 21 [2021-11-07 02:23:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:26,845 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 394 transitions. [2021-11-07 02:23:26,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2021-11-07 02:23:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:23:26,846 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:26,846 INFO L513 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] [2021-11-07 02:23:26,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:23:26,846 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:26,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 458626303, now seen corresponding path program 1 times [2021-11-07 02:23:26,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:26,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081643131] [2021-11-07 02:23:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:26,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:26,900 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:26,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081643131] [2021-11-07 02:23:26,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081643131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:26,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:26,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:26,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037493465] [2021-11-07 02:23:26,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:26,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:26,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:26,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:26,902 INFO L87 Difference]: Start difference. First operand 310 states and 394 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:27,078 INFO L93 Difference]: Finished difference Result 373 states and 457 transitions. [2021-11-07 02:23:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:23:27,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:23:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:27,081 INFO L225 Difference]: With dead ends: 373 [2021-11-07 02:23:27,081 INFO L226 Difference]: Without dead ends: 369 [2021-11-07 02:23:27,084 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:23:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-07 02:23:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 317. [2021-11-07 02:23:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 298 states have (on average 1.3456375838926173) internal successors, (401), 316 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 401 transitions. [2021-11-07 02:23:27,108 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 401 transitions. Word has length 22 [2021-11-07 02:23:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:27,108 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 401 transitions. [2021-11-07 02:23:27,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 401 transitions. [2021-11-07 02:23:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:23:27,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:27,112 INFO L513 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] [2021-11-07 02:23:27,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:23:27,112 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 458614387, now seen corresponding path program 1 times [2021-11-07 02:23:27,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:27,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851595396] [2021-11-07 02:23:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:27,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:27,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:27,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851595396] [2021-11-07 02:23:27,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851595396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:27,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:27,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:27,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694868605] [2021-11-07 02:23:27,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:27,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:27,187 INFO L87 Difference]: Start difference. First operand 317 states and 401 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:27,399 INFO L93 Difference]: Finished difference Result 453 states and 584 transitions. [2021-11-07 02:23:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:23:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:27,402 INFO L225 Difference]: With dead ends: 453 [2021-11-07 02:23:27,402 INFO L226 Difference]: Without dead ends: 431 [2021-11-07 02:23:27,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-07 02:23:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 302. [2021-11-07 02:23:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 283 states have (on average 1.3568904593639577) internal successors, (384), 301 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 384 transitions. [2021-11-07 02:23:27,427 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 384 transitions. Word has length 22 [2021-11-07 02:23:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:27,427 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 384 transitions. [2021-11-07 02:23:27,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 384 transitions. [2021-11-07 02:23:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:23:27,428 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:27,428 INFO L513 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] [2021-11-07 02:23:27,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 02:23:27,429 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:27,429 INFO L85 PathProgramCache]: Analyzing trace with hash -535361200, now seen corresponding path program 1 times [2021-11-07 02:23:27,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:27,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970195396] [2021-11-07 02:23:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:27,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:27,476 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:27,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970195396] [2021-11-07 02:23:27,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970195396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:27,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:27,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:27,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201644054] [2021-11-07 02:23:27,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:27,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:27,478 INFO L87 Difference]: Start difference. First operand 302 states and 384 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:27,633 INFO L93 Difference]: Finished difference Result 401 states and 512 transitions. [2021-11-07 02:23:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:27,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:23:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:27,637 INFO L225 Difference]: With dead ends: 401 [2021-11-07 02:23:27,637 INFO L226 Difference]: Without dead ends: 389 [2021-11-07 02:23:27,638 INFO L786 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 [2021-11-07 02:23:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-07 02:23:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 314. [2021-11-07 02:23:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 295 states have (on average 1.3627118644067797) internal successors, (402), 313 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 402 transitions. [2021-11-07 02:23:27,662 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 402 transitions. Word has length 22 [2021-11-07 02:23:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:27,663 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 402 transitions. [2021-11-07 02:23:27,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 402 transitions. [2021-11-07 02:23:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:23:27,664 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:27,664 INFO L513 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] [2021-11-07 02:23:27,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:23:27,664 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1018175500, now seen corresponding path program 1 times [2021-11-07 02:23:27,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:27,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044154404] [2021-11-07 02:23:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:27,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:27,816 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:27,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044154404] [2021-11-07 02:23:27,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044154404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:27,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:27,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:23:27,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727806901] [2021-11-07 02:23:27,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:27,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:27,819 INFO L87 Difference]: Start difference. First operand 314 states and 402 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:27,929 INFO L93 Difference]: Finished difference Result 518 states and 668 transitions. [2021-11-07 02:23:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:23:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:27,931 INFO L225 Difference]: With dead ends: 518 [2021-11-07 02:23:27,931 INFO L226 Difference]: Without dead ends: 291 [2021-11-07 02:23:27,932 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-07 02:23:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 278. [2021-11-07 02:23:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 277 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 348 transitions. [2021-11-07 02:23:27,991 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 348 transitions. Word has length 22 [2021-11-07 02:23:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:27,991 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 348 transitions. [2021-11-07 02:23:27,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 348 transitions. [2021-11-07 02:23:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:23:27,992 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:27,992 INFO L513 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] [2021-11-07 02:23:27,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:23:27,993 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash -931079678, now seen corresponding path program 1 times [2021-11-07 02:23:27,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:27,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086217064] [2021-11-07 02:23:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:27,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:28,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086217064] [2021-11-07 02:23:28,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086217064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:28,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872281924] [2021-11-07 02:23:28,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:28,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:28,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:28,030 INFO L87 Difference]: Start difference. First operand 278 states and 348 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,114 INFO L93 Difference]: Finished difference Result 307 states and 376 transitions. [2021-11-07 02:23:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:23:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 02:23:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,116 INFO L225 Difference]: With dead ends: 307 [2021-11-07 02:23:28,117 INFO L226 Difference]: Without dead ends: 276 [2021-11-07 02:23:28,117 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:23:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-07 02:23:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-11-07 02:23:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 261 states have (on average 1.318007662835249) internal successors, (344), 275 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 344 transitions. [2021-11-07 02:23:28,149 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 344 transitions. Word has length 23 [2021-11-07 02:23:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:28,149 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 344 transitions. [2021-11-07 02:23:28,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 344 transitions. [2021-11-07 02:23:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:23:28,150 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:28,150 INFO L513 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] [2021-11-07 02:23:28,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:23:28,153 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash 945040085, now seen corresponding path program 1 times [2021-11-07 02:23:28,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:28,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594104344] [2021-11-07 02:23:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:28,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:28,190 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594104344] [2021-11-07 02:23:28,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594104344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:28,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808897003] [2021-11-07 02:23:28,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:28,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:28,192 INFO L87 Difference]: Start difference. First operand 276 states and 344 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,328 INFO L93 Difference]: Finished difference Result 301 states and 370 transitions. [2021-11-07 02:23:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 02:23:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,330 INFO L225 Difference]: With dead ends: 301 [2021-11-07 02:23:28,330 INFO L226 Difference]: Without dead ends: 276 [2021-11-07 02:23:28,331 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-07 02:23:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-11-07 02:23:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 261 states have (on average 1.3103448275862069) internal successors, (342), 275 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 342 transitions. [2021-11-07 02:23:28,361 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 342 transitions. Word has length 23 [2021-11-07 02:23:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:28,361 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 342 transitions. [2021-11-07 02:23:28,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 342 transitions. [2021-11-07 02:23:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:23:28,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:28,362 INFO L513 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] [2021-11-07 02:23:28,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 02:23:28,363 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash 968947937, now seen corresponding path program 1 times [2021-11-07 02:23:28,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:28,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765865038] [2021-11-07 02:23:28,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:28,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:28,422 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765865038] [2021-11-07 02:23:28,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765865038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:28,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857270553] [2021-11-07 02:23:28,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:28,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:28,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:28,425 INFO L87 Difference]: Start difference. First operand 276 states and 342 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,578 INFO L93 Difference]: Finished difference Result 467 states and 588 transitions. [2021-11-07 02:23:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 02:23:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,580 INFO L225 Difference]: With dead ends: 467 [2021-11-07 02:23:28,581 INFO L226 Difference]: Without dead ends: 276 [2021-11-07 02:23:28,581 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-07 02:23:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-11-07 02:23:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 261 states have (on average 1.2873563218390804) internal successors, (336), 275 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 336 transitions. [2021-11-07 02:23:28,616 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 336 transitions. Word has length 23 [2021-11-07 02:23:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:28,618 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 336 transitions. [2021-11-07 02:23:28,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 336 transitions. [2021-11-07 02:23:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:23:28,619 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:28,619 INFO L513 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] [2021-11-07 02:23:28,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:23:28,620 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -239413340, now seen corresponding path program 1 times [2021-11-07 02:23:28,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:28,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17459989] [2021-11-07 02:23:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:28,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:28,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17459989] [2021-11-07 02:23:28,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17459989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:28,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528787365] [2021-11-07 02:23:28,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:28,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:28,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:28,670 INFO L87 Difference]: Start difference. First operand 276 states and 336 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,793 INFO L93 Difference]: Finished difference Result 292 states and 348 transitions. [2021-11-07 02:23:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:28,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 02:23:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,795 INFO L225 Difference]: With dead ends: 292 [2021-11-07 02:23:28,796 INFO L226 Difference]: Without dead ends: 278 [2021-11-07 02:23:28,796 INFO L786 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 [2021-11-07 02:23:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-07 02:23:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2021-11-07 02:23:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 258 states have (on average 1.2790697674418605) internal successors, (330), 271 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 330 transitions. [2021-11-07 02:23:28,834 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 330 transitions. Word has length 24 [2021-11-07 02:23:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:28,835 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 330 transitions. [2021-11-07 02:23:28,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 330 transitions. [2021-11-07 02:23:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:23:28,836 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:28,836 INFO L513 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] [2021-11-07 02:23:28,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 02:23:28,836 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:28,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash -823629734, now seen corresponding path program 1 times [2021-11-07 02:23:28,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:28,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230235546] [2021-11-07 02:23:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:28,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:28,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230235546] [2021-11-07 02:23:28,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230235546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:28,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804730114] [2021-11-07 02:23:28,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:28,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:28,887 INFO L87 Difference]: Start difference. First operand 272 states and 330 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:29,024 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2021-11-07 02:23:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 02:23:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:29,026 INFO L225 Difference]: With dead ends: 275 [2021-11-07 02:23:29,026 INFO L226 Difference]: Without dead ends: 260 [2021-11-07 02:23:29,027 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-07 02:23:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2021-11-07 02:23:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 259 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 316 transitions. [2021-11-07 02:23:29,057 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 316 transitions. Word has length 24 [2021-11-07 02:23:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,057 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 316 transitions. [2021-11-07 02:23:29,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 316 transitions. [2021-11-07 02:23:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:23:29,058 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,058 INFO L513 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] [2021-11-07 02:23:29,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 02:23:29,059 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:29,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1209473865, now seen corresponding path program 1 times [2021-11-07 02:23:29,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498145134] [2021-11-07 02:23:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,118 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498145134] [2021-11-07 02:23:29,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498145134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:29,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491797123] [2021-11-07 02:23:29,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:29,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:29,120 INFO L87 Difference]: Start difference. First operand 260 states and 316 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:29,357 INFO L93 Difference]: Finished difference Result 281 states and 338 transitions. [2021-11-07 02:23:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:23:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 02:23:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:29,359 INFO L225 Difference]: With dead ends: 281 [2021-11-07 02:23:29,359 INFO L226 Difference]: Without dead ends: 275 [2021-11-07 02:23:29,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:23:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-07 02:23:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2021-11-07 02:23:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 259 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 316 transitions. [2021-11-07 02:23:29,392 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 316 transitions. Word has length 24 [2021-11-07 02:23:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,392 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 316 transitions. [2021-11-07 02:23:29,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 316 transitions. [2021-11-07 02:23:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:23:29,393 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,393 INFO L513 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] [2021-11-07 02:23:29,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 02:23:29,394 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1185712742, now seen corresponding path program 1 times [2021-11-07 02:23:29,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27558440] [2021-11-07 02:23:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27558440] [2021-11-07 02:23:29,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27558440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:23:29,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329627029] [2021-11-07 02:23:29,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:29,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:29,471 INFO L87 Difference]: Start difference. First operand 260 states and 316 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:29,541 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2021-11-07 02:23:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:23:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:29,543 INFO L225 Difference]: With dead ends: 274 [2021-11-07 02:23:29,543 INFO L226 Difference]: Without dead ends: 271 [2021-11-07 02:23:29,544 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-07 02:23:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 266. [2021-11-07 02:23:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 252 states have (on average 1.2777777777777777) internal successors, (322), 265 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 322 transitions. [2021-11-07 02:23:29,598 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 322 transitions. Word has length 25 [2021-11-07 02:23:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,599 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 322 transitions. [2021-11-07 02:23:29,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 322 transitions. [2021-11-07 02:23:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:23:29,600 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,600 INFO L513 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] [2021-11-07 02:23:29,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 02:23:29,600 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1185700826, now seen corresponding path program 1 times [2021-11-07 02:23:29,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061762923] [2021-11-07 02:23:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061762923] [2021-11-07 02:23:29,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061762923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:29,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659154879] [2021-11-07 02:23:29,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:29,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:29,652 INFO L87 Difference]: Start difference. First operand 266 states and 322 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:29,783 INFO L93 Difference]: Finished difference Result 271 states and 326 transitions. [2021-11-07 02:23:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:23:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:29,785 INFO L225 Difference]: With dead ends: 271 [2021-11-07 02:23:29,785 INFO L226 Difference]: Without dead ends: 251 [2021-11-07 02:23:29,786 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-07 02:23:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-11-07 02:23:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 237 states have (on average 1.2869198312236287) internal successors, (305), 250 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2021-11-07 02:23:29,816 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 25 [2021-11-07 02:23:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,816 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2021-11-07 02:23:29,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2021-11-07 02:23:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:23:29,817 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,817 INFO L513 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] [2021-11-07 02:23:29,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 02:23:29,817 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 974701212, now seen corresponding path program 1 times [2021-11-07 02:23:29,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329108778] [2021-11-07 02:23:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,844 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329108778] [2021-11-07 02:23:29,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329108778] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:29,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958290844] [2021-11-07 02:23:29,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:29,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:29,846 INFO L87 Difference]: Start difference. First operand 251 states and 305 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:29,910 INFO L93 Difference]: Finished difference Result 456 states and 557 transitions. [2021-11-07 02:23:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 02:23:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:29,913 INFO L225 Difference]: With dead ends: 456 [2021-11-07 02:23:29,913 INFO L226 Difference]: Without dead ends: 277 [2021-11-07 02:23:29,914 INFO L786 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 [2021-11-07 02:23:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-07 02:23:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 227. [2021-11-07 02:23:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 219 states have (on average 1.2283105022831051) internal successors, (269), 226 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2021-11-07 02:23:29,942 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 25 [2021-11-07 02:23:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,943 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2021-11-07 02:23:29,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2021-11-07 02:23:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:23:29,944 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,944 INFO L513 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] [2021-11-07 02:23:29,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 02:23:29,944 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 550346227, now seen corresponding path program 1 times [2021-11-07 02:23:29,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902370429] [2021-11-07 02:23:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902370429] [2021-11-07 02:23:29,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902370429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:29,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705465086] [2021-11-07 02:23:29,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:29,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:29,983 INFO L87 Difference]: Start difference. First operand 227 states and 269 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:30,043 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2021-11-07 02:23:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:23:30,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 02:23:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:30,045 INFO L225 Difference]: With dead ends: 240 [2021-11-07 02:23:30,045 INFO L226 Difference]: Without dead ends: 217 [2021-11-07 02:23:30,046 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-07 02:23:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-11-07 02:23:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 209 states have (on average 1.229665071770335) internal successors, (257), 216 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2021-11-07 02:23:30,072 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 27 [2021-11-07 02:23:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:30,072 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2021-11-07 02:23:30,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2021-11-07 02:23:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:23:30,073 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:30,073 INFO L513 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] [2021-11-07 02:23:30,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 02:23:30,074 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1862601964, now seen corresponding path program 1 times [2021-11-07 02:23:30,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:30,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466069362] [2021-11-07 02:23:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:30,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:30,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:30,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466069362] [2021-11-07 02:23:30,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466069362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:30,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:30,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:30,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428394226] [2021-11-07 02:23:30,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:30,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:30,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:30,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:30,107 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:30,201 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2021-11-07 02:23:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:23:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 02:23:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:30,202 INFO L225 Difference]: With dead ends: 217 [2021-11-07 02:23:30,203 INFO L226 Difference]: Without dead ends: 197 [2021-11-07 02:23:30,203 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-07 02:23:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-11-07 02:23:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 190 states have (on average 1.2473684210526317) internal successors, (237), 196 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2021-11-07 02:23:30,239 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 27 [2021-11-07 02:23:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:30,240 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2021-11-07 02:23:30,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2021-11-07 02:23:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 02:23:30,241 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:30,241 INFO L513 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] [2021-11-07 02:23:30,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 02:23:30,241 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 324272811, now seen corresponding path program 1 times [2021-11-07 02:23:30,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:30,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897999755] [2021-11-07 02:23:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:30,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:30,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:30,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897999755] [2021-11-07 02:23:30,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897999755] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:30,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:30,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:23:30,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573538995] [2021-11-07 02:23:30,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:30,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:30,278 INFO L87 Difference]: Start difference. First operand 197 states and 237 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:30,397 INFO L93 Difference]: Finished difference Result 246 states and 297 transitions. [2021-11-07 02:23:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-07 02:23:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:30,399 INFO L225 Difference]: With dead ends: 246 [2021-11-07 02:23:30,399 INFO L226 Difference]: Without dead ends: 234 [2021-11-07 02:23:30,400 INFO L786 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 [2021-11-07 02:23:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-11-07 02:23:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2021-11-07 02:23:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.254335260115607) internal successors, (217), 177 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 217 transitions. [2021-11-07 02:23:30,424 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 217 transitions. Word has length 28 [2021-11-07 02:23:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:30,425 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 217 transitions. [2021-11-07 02:23:30,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 217 transitions. [2021-11-07 02:23:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 02:23:30,426 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:30,426 INFO L513 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] [2021-11-07 02:23:30,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 02:23:30,426 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:30,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash 720400468, now seen corresponding path program 1 times [2021-11-07 02:23:30,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:30,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081589815] [2021-11-07 02:23:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:30,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:30,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:30,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081589815] [2021-11-07 02:23:30,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081589815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:30,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:30,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:30,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375489947] [2021-11-07 02:23:30,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:30,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:30,498 INFO L87 Difference]: Start difference. First operand 178 states and 217 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:30,687 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2021-11-07 02:23:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:23:30,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-07 02:23:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:30,690 INFO L225 Difference]: With dead ends: 231 [2021-11-07 02:23:30,690 INFO L226 Difference]: Without dead ends: 227 [2021-11-07 02:23:30,690 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:23:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-07 02:23:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 168. [2021-11-07 02:23:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 164 states have (on average 1.2439024390243902) internal successors, (204), 167 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2021-11-07 02:23:30,714 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 37 [2021-11-07 02:23:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:30,714 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2021-11-07 02:23:30,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2021-11-07 02:23:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 02:23:30,715 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:30,715 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:30,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 02:23:30,715 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1886892860, now seen corresponding path program 1 times [2021-11-07 02:23:30,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:30,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070740840] [2021-11-07 02:23:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:30,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:30,835 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:30,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070740840] [2021-11-07 02:23:30,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070740840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:30,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:30,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:23:30,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719628411] [2021-11-07 02:23:30,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:23:30,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:23:30,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:23:30,837 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:31,069 INFO L93 Difference]: Finished difference Result 307 states and 371 transitions. [2021-11-07 02:23:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:23:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 02:23:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:31,072 INFO L225 Difference]: With dead ends: 307 [2021-11-07 02:23:31,072 INFO L226 Difference]: Without dead ends: 289 [2021-11-07 02:23:31,072 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:23:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-07 02:23:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 168. [2021-11-07 02:23:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 167 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2021-11-07 02:23:31,099 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 38 [2021-11-07 02:23:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:31,099 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2021-11-07 02:23:31,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2021-11-07 02:23:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 02:23:31,100 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:31,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:31,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 02:23:31,101 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 294429223, now seen corresponding path program 1 times [2021-11-07 02:23:31,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:31,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624722887] [2021-11-07 02:23:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:31,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:31,270 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:31,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624722887] [2021-11-07 02:23:31,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624722887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:31,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:31,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 02:23:31,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353187451] [2021-11-07 02:23:31,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:23:31,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:31,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:23:31,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:23:31,271 INFO L87 Difference]: Start difference. First operand 168 states and 203 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:32,449 INFO L93 Difference]: Finished difference Result 380 states and 464 transitions. [2021-11-07 02:23:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-07 02:23:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-07 02:23:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:32,451 INFO L225 Difference]: With dead ends: 380 [2021-11-07 02:23:32,451 INFO L226 Difference]: Without dead ends: 316 [2021-11-07 02:23:32,452 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2021-11-07 02:23:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-07 02:23:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 256. [2021-11-07 02:23:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 252 states have (on average 1.2301587301587302) internal successors, (310), 255 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 310 transitions. [2021-11-07 02:23:32,497 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 310 transitions. Word has length 39 [2021-11-07 02:23:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:32,498 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 310 transitions. [2021-11-07 02:23:32,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 310 transitions. [2021-11-07 02:23:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-07 02:23:32,498 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:32,499 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:32,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 02:23:32,499 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:32,499 INFO L85 PathProgramCache]: Analyzing trace with hash 871358399, now seen corresponding path program 1 times [2021-11-07 02:23:32,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:32,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164425539] [2021-11-07 02:23:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:32,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:32,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:32,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164425539] [2021-11-07 02:23:32,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164425539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:32,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:32,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:32,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892701286] [2021-11-07 02:23:32,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:32,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:32,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:32,541 INFO L87 Difference]: Start difference. First operand 256 states and 310 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:32,672 INFO L93 Difference]: Finished difference Result 479 states and 575 transitions. [2021-11-07 02:23:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:23:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-07 02:23:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:32,675 INFO L225 Difference]: With dead ends: 479 [2021-11-07 02:23:32,675 INFO L226 Difference]: Without dead ends: 353 [2021-11-07 02:23:32,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-07 02:23:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2021-11-07 02:23:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 252 states have (on average 1.2222222222222223) internal successors, (308), 255 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 308 transitions. [2021-11-07 02:23:32,732 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 308 transitions. Word has length 41 [2021-11-07 02:23:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:32,733 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 308 transitions. [2021-11-07 02:23:32,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 308 transitions. [2021-11-07 02:23:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-07 02:23:32,734 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:32,734 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:32,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 02:23:32,734 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1142702850, now seen corresponding path program 1 times [2021-11-07 02:23:32,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:32,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429197780] [2021-11-07 02:23:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:32,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:32,810 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:32,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429197780] [2021-11-07 02:23:32,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429197780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:32,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:32,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:23:32,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205872475] [2021-11-07 02:23:32,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:23:32,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:23:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:23:32,813 INFO L87 Difference]: Start difference. First operand 256 states and 308 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:32,982 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2021-11-07 02:23:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:23:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-07 02:23:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:32,984 INFO L225 Difference]: With dead ends: 277 [2021-11-07 02:23:32,984 INFO L226 Difference]: Without dead ends: 240 [2021-11-07 02:23:32,984 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:23:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-07 02:23:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2021-11-07 02:23:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 230 states have (on average 1.2347826086956522) internal successors, (284), 233 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2021-11-07 02:23:33,028 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 41 [2021-11-07 02:23:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:33,028 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2021-11-07 02:23:33,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2021-11-07 02:23:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 02:23:33,029 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:33,029 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:33,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 02:23:33,029 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1246147497, now seen corresponding path program 1 times [2021-11-07 02:23:33,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:33,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46278186] [2021-11-07 02:23:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:33,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:33,120 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:33,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46278186] [2021-11-07 02:23:33,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46278186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:33,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:33,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 02:23:33,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155563435] [2021-11-07 02:23:33,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 02:23:33,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:33,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 02:23:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-07 02:23:33,122 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:33,288 INFO L93 Difference]: Finished difference Result 240 states and 287 transitions. [2021-11-07 02:23:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:23:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-07 02:23:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:33,290 INFO L225 Difference]: With dead ends: 240 [2021-11-07 02:23:33,290 INFO L226 Difference]: Without dead ends: 213 [2021-11-07 02:23:33,291 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:23:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-07 02:23:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2021-11-07 02:23:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 118 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2021-11-07 02:23:33,313 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 42 [2021-11-07 02:23:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:33,313 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2021-11-07 02:23:33,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2021-11-07 02:23:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 02:23:33,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:33,314 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:33,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 02:23:33,315 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2034988657, now seen corresponding path program 1 times [2021-11-07 02:23:33,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:33,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345714453] [2021-11-07 02:23:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:33,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:33,376 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:33,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345714453] [2021-11-07 02:23:33,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345714453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:33,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:33,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:33,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369099478] [2021-11-07 02:23:33,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:33,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:33,378 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:33,502 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2021-11-07 02:23:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:23:33,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-07 02:23:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:33,504 INFO L225 Difference]: With dead ends: 174 [2021-11-07 02:23:33,504 INFO L226 Difference]: Without dead ends: 166 [2021-11-07 02:23:33,504 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:23:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-07 02:23:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2021-11-07 02:23:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-11-07 02:23:33,545 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 51 [2021-11-07 02:23:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:33,546 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-11-07 02:23:33,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-11-07 02:23:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 02:23:33,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:33,547 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:33,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 02:23:33,547 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1752254948, now seen corresponding path program 1 times [2021-11-07 02:23:33,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:33,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106984435] [2021-11-07 02:23:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:33,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:33,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:33,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106984435] [2021-11-07 02:23:33,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106984435] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:33,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:33,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:33,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251729756] [2021-11-07 02:23:33,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:33,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:33,616 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:33,762 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2021-11-07 02:23:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:23:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-07 02:23:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:33,764 INFO L225 Difference]: With dead ends: 166 [2021-11-07 02:23:33,764 INFO L226 Difference]: Without dead ends: 160 [2021-11-07 02:23:33,764 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:23:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-07 02:23:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 108. [2021-11-07 02:23:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.1415094339622642) internal successors, (121), 107 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2021-11-07 02:23:33,784 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 63 [2021-11-07 02:23:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:33,784 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2021-11-07 02:23:33,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2021-11-07 02:23:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 02:23:33,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:33,786 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:33,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 02:23:33,786 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1700554364, now seen corresponding path program 1 times [2021-11-07 02:23:33,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:33,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251104589] [2021-11-07 02:23:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:33,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:33,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:33,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251104589] [2021-11-07 02:23:33,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251104589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:33,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:33,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:33,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035398068] [2021-11-07 02:23:33,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:33,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:33,866 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:33,994 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2021-11-07 02:23:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:23:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-07 02:23:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:33,995 INFO L225 Difference]: With dead ends: 154 [2021-11-07 02:23:33,996 INFO L226 Difference]: Without dead ends: 148 [2021-11-07 02:23:33,996 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:23:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-07 02:23:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 99. [2021-11-07 02:23:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-11-07 02:23:34,019 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 64 [2021-11-07 02:23:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:34,019 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-11-07 02:23:34,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-11-07 02:23:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 02:23:34,024 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:34,025 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:34,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 02:23:34,025 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 48 more)] === [2021-11-07 02:23:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -385312029, now seen corresponding path program 1 times [2021-11-07 02:23:34,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:34,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495726782] [2021-11-07 02:23:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:34,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:34,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:34,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495726782] [2021-11-07 02:23:34,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495726782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:34,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:34,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:23:34,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599048097] [2021-11-07 02:23:34,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:23:34,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:34,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:23:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:34,102 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:34,223 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2021-11-07 02:23:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:23:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-07 02:23:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:34,224 INFO L225 Difference]: With dead ends: 134 [2021-11-07 02:23:34,224 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 02:23:34,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:23:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 02:23:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 02:23:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 02:23:34,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-11-07 02:23:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:34,225 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 02:23:34,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 02:23:34,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 02:23:34,230 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,234 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,234 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,234 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,237 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,237 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,237 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,238 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,238 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,238 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,238 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,239 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,239 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,239 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,239 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,241 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,241 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,241 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,241 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,241 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,242 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,244 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,244 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,244 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,244 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,244 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,245 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,245 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:23:34,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 02:23:34,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 02:23:34,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:34,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:35,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:36,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:23:48,523 INFO L853 garLoopResultBuilder]: At program point L630(lines 461 632) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (<= .cse0 0)))) [2021-11-07 02:23:48,524 INFO L853 garLoopResultBuilder]: At program point L105(lines 105 132) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,524 INFO L857 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2021-11-07 02:23:48,524 INFO L857 garLoopResultBuilder]: For program point L1031-2(lines 1026 1036) no Hoare annotation was computed. [2021-11-07 02:23:48,524 INFO L853 garLoopResultBuilder]: At program point L108(lines 108 131) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,524 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point L774(lines 774 778) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L857 garLoopResultBuilder]: For program point L511(lines 511 513) no Hoare annotation was computed. [2021-11-07 02:23:48,525 INFO L853 garLoopResultBuilder]: At program point L644(lines 701 703) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,526 INFO L853 garLoopResultBuilder]: At program point L780(lines 773 830) the Hoare annotation is: (let ((.cse20 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (.cse11 (+ ~SKIP2~0 3)) (.cse17 (<= ULTIMATE.start_main_~status~6 258)) (.cse19 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse0 (= 2 ~DC~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse14 (<= 6 ~MPR3~0)) (.cse13 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse19)) (.cse9 (<= 7 ~IPC~0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse22 (or .cse17 (<= 260 ULTIMATE.start_main_~status~6))) (.cse15 (= ~s~0 ~DC~0)) (.cse16 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse11 ~IPC~0)) (.cse18 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (<= 4 ~SKIP2~0)) (.cse23 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse20))) (or (and (< ULTIMATE.start_main_~status~6 (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 ULTIMATE.start_PoCallDriver_~returnVal~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_PoCallDriver_~returnVal~0 ~lowerDriverReturn~0)) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse9 .cse10 .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 (<= .cse11 ~s~0) .cse3 .cse12 (= ~IPC~0 ~s~0)) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse7 .cse8) (and .cse13 .cse14 .cse9 .cse10 .cse15 .cse16 .cse17 .cse1 .cse18 .cse2 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse19 .cse20) (and .cse13 .cse14 .cse21 .cse9 .cse10 .cse22 .cse15 .cse16 .cse1 .cse2 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23) (= ~s~0 ~UNLOADED~0) (and .cse9 .cse10 .cse15 .cse16 .cse1 .cse2 .cse3 (<= (+ 1073741789 ULTIMATE.start_main_~status~6) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res|) 0)) (and .cse10 .cse15 .cse16 (= ULTIMATE.start_main_~status~6 0) .cse1 (not (= ~IPC~0 2)) .cse3) (and .cse13 .cse21 .cse9 .cse10 .cse22 .cse15 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse16 .cse1 .cse2 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse18) .cse3 .cse4 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse5 .cse6 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse7 .cse23)))) [2021-11-07 02:23:48,526 INFO L857 garLoopResultBuilder]: For program point L782(lines 782 786) no Hoare annotation was computed. [2021-11-07 02:23:48,526 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,526 INFO L857 garLoopResultBuilder]: For program point L519(lines 519 524) no Hoare annotation was computed. [2021-11-07 02:23:48,528 INFO L857 garLoopResultBuilder]: For program point L519-2(lines 501 631) no Hoare annotation was computed. [2021-11-07 02:23:48,528 INFO L857 garLoopResultBuilder]: For program point L387(lines 387 432) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 418) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point L388-2(lines 388 418) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 270) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point L257-1(lines 257 270) no Hoare annotation was computed. [2021-11-07 02:23:48,529 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,530 INFO L853 garLoopResultBuilder]: At program point L788(lines 781 829) the Hoare annotation is: (let ((.cse20 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (.cse11 (+ ~SKIP2~0 3)) (.cse17 (<= ULTIMATE.start_main_~status~6 258)) (.cse19 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse0 (= 2 ~DC~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse14 (<= 6 ~MPR3~0)) (.cse13 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse19)) (.cse9 (<= 7 ~IPC~0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse22 (or .cse17 (<= 260 ULTIMATE.start_main_~status~6))) (.cse15 (= ~s~0 ~DC~0)) (.cse16 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse11 ~IPC~0)) (.cse18 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (<= 4 ~SKIP2~0)) (.cse23 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse20))) (or (and (< ULTIMATE.start_main_~status~6 (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 ULTIMATE.start_PoCallDriver_~returnVal~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_PoCallDriver_~returnVal~0 ~lowerDriverReturn~0)) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse9 .cse10 .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 (<= .cse11 ~s~0) .cse3 .cse12 (= ~IPC~0 ~s~0)) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse7 .cse8) (and .cse13 .cse14 .cse9 .cse10 .cse15 .cse16 .cse17 .cse1 .cse18 .cse2 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse19 .cse20) (and .cse13 .cse14 .cse21 .cse9 .cse10 .cse22 .cse15 .cse16 .cse1 .cse2 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23) (= ~s~0 ~UNLOADED~0) (and .cse9 .cse10 .cse15 .cse16 .cse1 .cse2 .cse3 (<= (+ 1073741789 ULTIMATE.start_main_~status~6) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res|) 0)) (and .cse10 .cse15 .cse16 (= ULTIMATE.start_main_~status~6 0) .cse1 (not (= ~IPC~0 2)) .cse3) (and .cse13 .cse21 .cse9 .cse10 .cse22 .cse15 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse16 .cse1 .cse2 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse18) .cse3 .cse4 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse5 .cse6 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse7 .cse23)))) [2021-11-07 02:23:48,530 INFO L860 garLoopResultBuilder]: At program point L789(lines 773 830) the Hoare annotation is: true [2021-11-07 02:23:48,530 INFO L857 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2021-11-07 02:23:48,531 INFO L853 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: (let ((.cse23 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse24 (* 4294967296 .cse23)) (.cse22 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse21 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse2 (<= 6 ~MPR3~0)) (.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse3 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse21)) (.cse4 (= ~s~0 ~DC~0)) (.cse5 (<= 0 .cse22)) (.cse6 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (= 2 ~s~0)) (.cse8 (< (+ .cse24 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse9 (not (= ~pended~0 1))) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= (+ .cse23 1) 0)) (.cse20 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse12 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse24 3221225494))) (.cse13 (= ~routine~0 0)) (.cse14 (<= 3 ~SKIP1~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (= ~NP~0 1)) (.cse17 (< 0 (+ .cse23 2))) (.cse18 (<= 4 ~SKIP2~0)) (.cse19 (<= .cse22 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse21 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse20) .cse12 .cse13 .cse14 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse15 .cse16 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse17 .cse18 .cse19))))) [2021-11-07 02:23:48,531 INFO L853 garLoopResultBuilder]: At program point L922(lines 880 950) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,531 INFO L853 garLoopResultBuilder]: At program point L922-1(lines 880 950) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,531 INFO L853 garLoopResultBuilder]: At program point L922-2(lines 880 950) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,532 INFO L853 garLoopResultBuilder]: At program point L922-3(lines 880 950) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,532 INFO L853 garLoopResultBuilder]: At program point L922-4(lines 880 950) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,532 INFO L857 garLoopResultBuilder]: For program point L790(lines 790 827) no Hoare annotation was computed. [2021-11-07 02:23:48,532 INFO L853 garLoopResultBuilder]: At program point L922-5(lines 880 950) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,533 INFO L853 garLoopResultBuilder]: At program point L922-6(lines 880 950) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,533 INFO L853 garLoopResultBuilder]: At program point L922-7(lines 880 950) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,533 INFO L853 garLoopResultBuilder]: At program point L922-8(lines 880 950) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,533 INFO L857 garLoopResultBuilder]: For program point L526(lines 501 631) no Hoare annotation was computed. [2021-11-07 02:23:48,533 INFO L857 garLoopResultBuilder]: For program point L262(lines 262 269) no Hoare annotation was computed. [2021-11-07 02:23:48,534 INFO L853 garLoopResultBuilder]: At program point L262-1(lines 1 1100) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,534 INFO L857 garLoopResultBuilder]: For program point L262-2(lines 262 269) no Hoare annotation was computed. [2021-11-07 02:23:48,534 INFO L853 garLoopResultBuilder]: At program point L262-3(lines 1 1100) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,534 INFO L857 garLoopResultBuilder]: For program point L791(lines 791 826) no Hoare annotation was computed. [2021-11-07 02:23:48,534 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,534 INFO L857 garLoopResultBuilder]: For program point L792(lines 792 802) no Hoare annotation was computed. [2021-11-07 02:23:48,535 INFO L853 garLoopResultBuilder]: At program point L528(lines 528 530) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,535 INFO L857 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2021-11-07 02:23:48,535 INFO L853 garLoopResultBuilder]: At program point L133(lines 96 135) the Hoare annotation is: (let ((.cse25 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse23 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (.cse26 (* 4294967296 .cse25)) (.cse24 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802)) (.cse22 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse11 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse0 (= ~compRegistered~0 1)) (.cse21 (<= 6 ~MPR3~0)) (.cse2 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse22)) (.cse3 (= ~s~0 ~DC~0)) (.cse4 (<= 0 .cse24)) (.cse6 (= 2 ~s~0)) (.cse7 (< (+ .cse26 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse10 (<= (+ .cse25 1) 0)) (.cse12 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse26 3221225494))) (.cse17 (< 0 (+ .cse25 2))) (.cse19 (<= .cse24 0)) (.cse20 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse23)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (not (= ~pended~0 1))) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse13 (= ~routine~0 0)) (.cse14 (<= 3 ~SKIP1~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (= ~NP~0 1)) (.cse18 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse11) .cse12 .cse13 .cse14 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse15 .cse16 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse10 .cse12 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse22 .cse19 .cse23) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 (= 2 ~DC~0) .cse5 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse18 (= ~SKIP2~0 ~s~0)))))) [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point L930(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point L930-1(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point L930-2(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point L930-3(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,536 INFO L857 garLoopResultBuilder]: For program point L930-4(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point L930-5(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point L930-6(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point L930-7(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point L930-8(lines 930 947) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,537 INFO L853 garLoopResultBuilder]: At program point L404-2(lines 404 411) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,537 INFO L857 garLoopResultBuilder]: For program point L405(lines 404 411) no Hoare annotation was computed. [2021-11-07 02:23:48,538 INFO L857 garLoopResultBuilder]: For program point L538(lines 538 540) no Hoare annotation was computed. [2021-11-07 02:23:48,538 INFO L853 garLoopResultBuilder]: At program point L1068(lines 1024 1099) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,538 INFO L853 garLoopResultBuilder]: At program point L804(lines 791 826) the Hoare annotation is: (let ((.cse15 (= ~s~0 ~DC~0)) (.cse16 (= 2 ~s~0)) (.cse14 (not (= ~SKIP2~0 2))) (.cse20 (= 2 ~DC~0)) (.cse17 (not (= ~pended~0 1))) (.cse21 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse18 (not (= ~IPC~0 2))) (.cse19 (= ~routine~0 0))) (let ((.cse12 (<= 7 ~IPC~0)) (.cse13 (or (and .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse14 .cse20 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse17 .cse21 .cse18 .cse19 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)))) (.cse11 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (.cse9 (<= ULTIMATE.start_main_~status~6 258)) (.cse10 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse1 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse10)) (.cse2 (or .cse9 (<= 260 ULTIMATE.start_main_~status~6))) (.cse5 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse11)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse3 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse4 (<= 4 ~SKIP2~0)) (.cse6 (let ((.cse22 (<= 3 ~SKIP1~0)) (.cse23 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse24 (= ~NP~0 1))) (or (and (< ULTIMATE.start_main_~status~6 (+ ~lowerDriverReturn~0 1)) .cse12 .cse14 (<= ~lowerDriverReturn~0 ULTIMATE.start_PoCallDriver_~returnVal~0) .cse20 .cse17 .cse21 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6) .cse19 .cse22 .cse23 .cse24 (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_PoCallDriver_~returnVal~0 ~lowerDriverReturn~0)) (and .cse12 .cse22 .cse13 .cse23 .cse24)))) (.cse8 (not .cse16))) (or (and .cse0 .cse1 .cse2 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse3) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse4 .cse5 .cse6) (and .cse8 .cse4 .cse6) (and .cse0 .cse7 .cse9 .cse3 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse4 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse10 .cse11 .cse6) (and .cse12 .cse13 (<= (+ 1073741789 ULTIMATE.start_main_~status~6) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res|) 0)) (and .cse14 .cse15 .cse16 (= ULTIMATE.start_main_~status~6 0) .cse17 .cse18 .cse19) (and .cse12 .cse8 .cse13))))) [2021-11-07 02:23:48,538 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,539 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,539 INFO L857 garLoopResultBuilder]: For program point L806(lines 806 810) no Hoare annotation was computed. [2021-11-07 02:23:48,539 INFO L857 garLoopResultBuilder]: For program point L939(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,539 INFO L857 garLoopResultBuilder]: For program point L939-2(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,539 INFO L857 garLoopResultBuilder]: For program point L939-4(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,539 INFO L857 garLoopResultBuilder]: For program point L939-6(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,540 INFO L857 garLoopResultBuilder]: For program point L939-8(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,540 INFO L857 garLoopResultBuilder]: For program point L939-10(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,540 INFO L857 garLoopResultBuilder]: For program point L939-12(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,540 INFO L857 garLoopResultBuilder]: For program point L939-14(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,540 INFO L857 garLoopResultBuilder]: For program point L939-16(lines 939 946) no Hoare annotation was computed. [2021-11-07 02:23:48,540 INFO L857 garLoopResultBuilder]: For program point L279(lines 279 284) no Hoare annotation was computed. [2021-11-07 02:23:48,541 INFO L853 garLoopResultBuilder]: At program point L279-2(lines 279 284) the Hoare annotation is: (let ((.cse22 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse23 (* 4294967296 .cse22)) (.cse21 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (<= 6 ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (<= 0 .cse21)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse23 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (not (= ~pended~0 1))) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ .cse22 1) 0)) (.cse10 (= ~s~0 ~NP~0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse23 3221225494))) (.cse12 (= ~routine~0 0)) (.cse13 (<= 3 ~SKIP1~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse15 (= ~customIrp~0 0)) (.cse16 (= ~NP~0 1)) (.cse17 (< 0 (+ .cse22 2))) (.cse18 (<= 4 ~SKIP2~0)) (.cse19 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) (.cse20 (<= .cse21 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))))) [2021-11-07 02:23:48,541 INFO L857 garLoopResultBuilder]: For program point L279-3(lines 279 284) no Hoare annotation was computed. [2021-11-07 02:23:48,541 INFO L853 garLoopResultBuilder]: At program point L279-5(lines 279 284) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19)) (.cse18 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (<= 0 .cse18)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse6 (not (= ~pended~0 1))) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse19 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse11 (= ~routine~0 0)) (.cse12 (<= 3 ~SKIP1~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (= ~NP~0 1)) (.cse15 (< 0 (+ .cse19 2))) (.cse16 (<= 4 ~SKIP2~0)) (.cse17 (<= .cse18 0))) (or (and .cse0 .cse1 (<= 6 ~MPR3~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse11 .cse12 .cse13 (= ~customIrp~0 0) .cse14 .cse15 .cse16 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse17) (and .cse0 .cse1 .cse2 .cse3 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse13 .cse14 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse15 .cse16 .cse17))))) [2021-11-07 02:23:48,541 INFO L853 garLoopResultBuilder]: At program point L412(lines 403 413) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,541 INFO L857 garLoopResultBuilder]: For program point L546(lines 546 551) no Hoare annotation was computed. [2021-11-07 02:23:48,542 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,542 INFO L857 garLoopResultBuilder]: For program point L546-2(lines 546 551) no Hoare annotation was computed. [2021-11-07 02:23:48,542 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,542 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,542 INFO L857 garLoopResultBuilder]: For program point L1076(lines 1076 1096) no Hoare annotation was computed. [2021-11-07 02:23:48,542 INFO L857 garLoopResultBuilder]: For program point L812(lines 812 824) no Hoare annotation was computed. [2021-11-07 02:23:48,543 INFO L857 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-11-07 02:23:48,543 INFO L853 garLoopResultBuilder]: At program point L683(lines 678 832) the Hoare annotation is: (let ((.cse20 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (.cse11 (+ ~SKIP2~0 3)) (.cse17 (<= ULTIMATE.start_main_~status~6 258)) (.cse19 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse0 (= 2 ~DC~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse14 (<= 6 ~MPR3~0)) (.cse13 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse19)) (.cse9 (<= 7 ~IPC~0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse22 (or .cse17 (<= 260 ULTIMATE.start_main_~status~6))) (.cse15 (= ~s~0 ~DC~0)) (.cse16 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse11 ~IPC~0)) (.cse18 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (<= 4 ~SKIP2~0)) (.cse23 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse20))) (or (and (< ULTIMATE.start_main_~status~6 (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 ULTIMATE.start_PoCallDriver_~returnVal~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_PoCallDriver_~returnVal~0 ~lowerDriverReturn~0)) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse9 .cse10 .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 (<= .cse11 ~s~0) .cse3 .cse12 (= ~IPC~0 ~s~0)) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse7 .cse8) (and .cse13 .cse14 .cse9 .cse10 .cse15 .cse16 .cse17 .cse1 .cse18 .cse2 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse19 .cse20) (and .cse13 .cse14 .cse21 .cse9 .cse10 .cse22 .cse15 .cse16 .cse1 .cse2 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23) (= ~s~0 ~UNLOADED~0) (and .cse9 .cse10 .cse15 .cse16 .cse1 .cse2 .cse3 (<= (+ 1073741789 ULTIMATE.start_main_~status~6) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res|) 0)) (and .cse10 .cse15 .cse16 (= ULTIMATE.start_main_~status~6 0) .cse1 (not (= ~IPC~0 2)) .cse3) (and .cse13 .cse21 .cse9 .cse10 .cse22 .cse15 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse16 .cse1 .cse2 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse18) .cse3 .cse4 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse5 .cse6 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse7 .cse23)))) [2021-11-07 02:23:48,543 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,543 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,543 INFO L857 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2021-11-07 02:23:48,544 INFO L857 garLoopResultBuilder]: For program point L555(lines 555 582) no Hoare annotation was computed. [2021-11-07 02:23:48,544 INFO L853 garLoopResultBuilder]: At program point L555-1(lines 526 624) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,544 INFO L853 garLoopResultBuilder]: At program point L557(lines 557 559) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,544 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point L1088(lines 1088 1095) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-11-07 02:23:48,545 INFO L857 garLoopResultBuilder]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-11-07 02:23:48,546 INFO L853 garLoopResultBuilder]: At program point L431(lines 354 435) the Hoare annotation is: (let ((.cse8 (+ ~SKIP2~0 3))) (let ((.cse0 (<= 7 ~IPC~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= .cse8 ~IPC~0)) (.cse6 (= ~routine~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res|) 0) .cse7) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse0 .cse1 (= 2 ~DC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse4 (<= .cse8 ~s~0) .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDeviceControl_#res|) (= ~IPC~0 ~s~0) .cse7) (and .cse2 .cse3 (= ULTIMATE.start_DiskPerfDeviceControl_~status~4 0) (= |ULTIMATE.start_DiskPerfDeviceControl_#res| 0) .cse4 .cse5 .cse6 (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) .cse7)))) [2021-11-07 02:23:48,546 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,546 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,546 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,546 INFO L860 garLoopResultBuilder]: At program point L831(lines 647 833) the Hoare annotation is: true [2021-11-07 02:23:48,546 INFO L857 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2021-11-07 02:23:48,547 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,547 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,547 INFO L853 garLoopResultBuilder]: At program point L707(lines 707 766) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,547 INFO L857 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2021-11-07 02:23:48,547 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,547 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,548 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,548 INFO L853 garLoopResultBuilder]: At program point L712(lines 712 765) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,548 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,548 INFO L857 garLoopResultBuilder]: For program point L318(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,548 INFO L857 garLoopResultBuilder]: For program point L318-1(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,548 INFO L857 garLoopResultBuilder]: For program point L318-2(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-3(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-4(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-5(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-6(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-7(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-8(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,549 INFO L857 garLoopResultBuilder]: For program point L318-9(lines 318 320) no Hoare annotation was computed. [2021-11-07 02:23:48,550 INFO L857 garLoopResultBuilder]: For program point L979(lines 979 998) no Hoare annotation was computed. [2021-11-07 02:23:48,550 INFO L857 garLoopResultBuilder]: For program point L979-1(lines 979 998) no Hoare annotation was computed. [2021-11-07 02:23:48,550 INFO L857 garLoopResultBuilder]: For program point L979-2(lines 979 998) no Hoare annotation was computed. [2021-11-07 02:23:48,550 INFO L857 garLoopResultBuilder]: For program point L979-3(lines 979 998) no Hoare annotation was computed. [2021-11-07 02:23:48,550 INFO L857 garLoopResultBuilder]: For program point L979-4(lines 979 998) no Hoare annotation was computed. [2021-11-07 02:23:48,550 INFO L857 garLoopResultBuilder]: For program point L979-5(lines 979 998) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point L980(lines 980 985) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point L980-2(lines 980 985) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point L980-4(lines 980 985) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point L980-6(lines 980 985) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point L980-8(lines 980 985) no Hoare annotation was computed. [2021-11-07 02:23:48,551 INFO L857 garLoopResultBuilder]: For program point L980-10(lines 980 985) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56-4(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,552 INFO L857 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,553 INFO L857 garLoopResultBuilder]: For program point L56-7(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,553 INFO L857 garLoopResultBuilder]: For program point L56-8(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,553 INFO L857 garLoopResultBuilder]: For program point L56-9(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,553 INFO L857 garLoopResultBuilder]: For program point L56-10(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,553 INFO L853 garLoopResultBuilder]: At program point L717(lines 717 764) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,553 INFO L857 garLoopResultBuilder]: For program point L56-11(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-12(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-13(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-14(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-15(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-16(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-17(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,554 INFO L857 garLoopResultBuilder]: For program point L56-18(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-19(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-20(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-21(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-22(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-23(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-24(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,555 INFO L857 garLoopResultBuilder]: For program point L56-25(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,556 INFO L857 garLoopResultBuilder]: For program point L56-26(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,556 INFO L857 garLoopResultBuilder]: For program point L56-27(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,556 INFO L857 garLoopResultBuilder]: For program point L56-28(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,556 INFO L857 garLoopResultBuilder]: For program point L56-29(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,556 INFO L857 garLoopResultBuilder]: For program point L56-30(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,556 INFO L853 garLoopResultBuilder]: At program point L57(lines 952 965) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,557 INFO L857 garLoopResultBuilder]: For program point L56-31(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,557 INFO L853 garLoopResultBuilder]: At program point L57-1(lines 952 965) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= 2 ~s~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,557 INFO L857 garLoopResultBuilder]: For program point L56-32(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,557 INFO L853 garLoopResultBuilder]: At program point L57-2(lines 952 965) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~DC~0)) (.cse1 (= 2 ~s~0)) (.cse2 (not (= ~pended~0 1))) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse5 (= ~compRegistered~0 0))) (or (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 1073741789 ULTIMATE.start_DiskPerfDeviceControl_~status~4) 0) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_DiskPerfDeviceControl_~status~4 0) .cse2 .cse3 .cse4 (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) .cse5))) [2021-11-07 02:23:48,557 INFO L857 garLoopResultBuilder]: For program point L56-33(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,557 INFO L857 garLoopResultBuilder]: For program point L56-34(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,558 INFO L857 garLoopResultBuilder]: For program point L56-35(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,558 INFO L853 garLoopResultBuilder]: At program point L57-5(lines 1 1100) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~s~0) (= ~routine~0 0) (= ~IPC~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,558 INFO L857 garLoopResultBuilder]: For program point L56-36(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,558 INFO L857 garLoopResultBuilder]: For program point L56-37(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,558 INFO L857 garLoopResultBuilder]: For program point L56-38(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,558 INFO L857 garLoopResultBuilder]: For program point L56-39(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,559 INFO L857 garLoopResultBuilder]: For program point L56-40(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,559 INFO L853 garLoopResultBuilder]: At program point L57-10(lines 1 1100) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (* 4294967296 .cse3)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (or .cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse2 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse3 1) 0) (or .cse0 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse2 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (< 0 (+ .cse3 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse1 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~s~0 1)))))) [2021-11-07 02:23:48,559 INFO L857 garLoopResultBuilder]: For program point L56-41(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,559 INFO L857 garLoopResultBuilder]: For program point L56-42(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,559 INFO L857 garLoopResultBuilder]: For program point L56-43(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,559 INFO L857 garLoopResultBuilder]: For program point L56-44(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,560 INFO L853 garLoopResultBuilder]: At program point L57-14(lines 1 1100) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (* 4294967296 .cse3)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (or .cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse2 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse3 1) 0) (or .cse0 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse2 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse3 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse1 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~s~0 1)))))) [2021-11-07 02:23:48,560 INFO L857 garLoopResultBuilder]: For program point L56-45(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,560 INFO L857 garLoopResultBuilder]: For program point L56-46(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,560 INFO L857 garLoopResultBuilder]: For program point L56-47(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,560 INFO L857 garLoopResultBuilder]: For program point L56-48(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,561 INFO L853 garLoopResultBuilder]: At program point L57-18(lines 1 1100) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (* 4294967296 .cse3)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (or .cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse2 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse3 1) 0) (or .cse0 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse2 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse3 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse1 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~s~0 1)))))) [2021-11-07 02:23:48,561 INFO L857 garLoopResultBuilder]: For program point L56-49(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,561 INFO L857 garLoopResultBuilder]: For program point L56-50(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,561 INFO L853 garLoopResultBuilder]: At program point L57-22(lines 1 1100) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (* 4294967296 .cse3)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (or .cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse2 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse3 1) 0) (or .cse0 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse2 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse3 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse1 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~s~0 1)))))) [2021-11-07 02:23:48,561 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 02:23:48,562 INFO L853 garLoopResultBuilder]: At program point L57-26(lines 1 1100) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (* 4294967296 .cse3)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (or .cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse2 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse3 1) 0) (or .cse0 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse2 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse3 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse1 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~s~0 1)))))) [2021-11-07 02:23:48,562 INFO L853 garLoopResultBuilder]: At program point L57-28(lines 952 965) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~s~0 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~s~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (<= .cse0 0)))) [2021-11-07 02:23:48,562 INFO L853 garLoopResultBuilder]: At program point L57-33(lines 1 1100) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (* 4294967296 .cse3)) (.cse1 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (or .cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse2 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse3 1) 0) (or .cse0 (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse2 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (< 0 (+ .cse3 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse1 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~s~0 1)))))) [2021-11-07 02:23:48,562 INFO L853 garLoopResultBuilder]: At program point L57-35(lines 952 965) the Hoare annotation is: (let ((.cse20 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse21 (* 4294967296 .cse20)) (.cse19 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (<= 0 .cse19)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= 2 ~s~0)) (.cse6 (< (+ .cse21 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (not (= ~pended~0 1))) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ .cse20 1) 0)) (.cse8 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse21 3221225494))) (.cse12 (= ~routine~0 0)) (.cse13 (<= 3 ~SKIP1~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse15 (= ~NP~0 1)) (.cse16 (< 0 (+ .cse20 2))) (.cse17 (<= 4 ~SKIP2~0)) (.cse18 (<= .cse19 0))) (or (and .cse0 .cse1 (<= 6 ~MPR3~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse12 .cse13 .cse14 (= ~customIrp~0 0) .cse15 .cse16 .cse17 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse18) (and .cse0 .cse1 .cse2 .cse3 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse8) .cse11 .cse12 .cse13 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse14 .cse15 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse16 .cse17 .cse18))))) [2021-11-07 02:23:48,563 INFO L853 garLoopResultBuilder]: At program point L57-36(lines 1 1100) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,563 INFO L853 garLoopResultBuilder]: At program point L57-39(lines 1 1100) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-11-07 02:23:48,563 INFO L853 garLoopResultBuilder]: At program point L57-40(lines 1 1100) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,563 INFO L853 garLoopResultBuilder]: At program point L57-43(lines 1 1100) the Hoare annotation is: (and (<= ~lowerDriverReturn~0 ULTIMATE.start_PoCallDriver_~returnVal~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_PoCallDriver_~returnVal~0 ~lowerDriverReturn~0)) [2021-11-07 02:23:48,564 INFO L853 garLoopResultBuilder]: At program point L57-46(lines 1 1100) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~s~0) (= ~routine~0 0) (= ~IPC~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,564 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,564 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,564 INFO L853 garLoopResultBuilder]: At program point L722(lines 722 763) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,564 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,565 INFO L853 garLoopResultBuilder]: At program point L987(lines 979 998) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2021-11-07 02:23:48,565 INFO L853 garLoopResultBuilder]: At program point L987-1(lines 979 998) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2021-11-07 02:23:48,565 INFO L853 garLoopResultBuilder]: At program point L987-2(lines 979 998) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2021-11-07 02:23:48,566 INFO L853 garLoopResultBuilder]: At program point L987-3(lines 979 998) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2021-11-07 02:23:48,566 INFO L853 garLoopResultBuilder]: At program point L987-4(lines 979 998) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (<= .cse0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2021-11-07 02:23:48,566 INFO L853 garLoopResultBuilder]: At program point L987-5(lines 979 998) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2021-11-07 02:23:48,566 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 202) no Hoare annotation was computed. [2021-11-07 02:23:48,566 INFO L853 garLoopResultBuilder]: At program point L727(lines 727 762) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,567 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,567 INFO L857 garLoopResultBuilder]: For program point L992(lines 992 996) no Hoare annotation was computed. [2021-11-07 02:23:48,567 INFO L853 garLoopResultBuilder]: At program point L992-1(lines 992 996) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,567 INFO L857 garLoopResultBuilder]: For program point L992-2(lines 992 996) no Hoare annotation was computed. [2021-11-07 02:23:48,568 INFO L853 garLoopResultBuilder]: At program point L992-3(lines 992 996) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,568 INFO L857 garLoopResultBuilder]: For program point L992-4(lines 992 996) no Hoare annotation was computed. [2021-11-07 02:23:48,568 INFO L853 garLoopResultBuilder]: At program point L992-5(lines 992 996) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,568 INFO L857 garLoopResultBuilder]: For program point L992-6(lines 992 996) no Hoare annotation was computed. [2021-11-07 02:23:48,568 INFO L853 garLoopResultBuilder]: At program point L992-7(lines 992 996) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,569 INFO L857 garLoopResultBuilder]: For program point L992-8(lines 992 996) no Hoare annotation was computed. [2021-11-07 02:23:48,569 INFO L853 garLoopResultBuilder]: At program point L992-9(lines 992 996) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (<= .cse0 0)))) [2021-11-07 02:23:48,569 INFO L857 garLoopResultBuilder]: For program point L992-10(lines 992 996) no Hoare annotation was computed. [2021-11-07 02:23:48,569 INFO L853 garLoopResultBuilder]: At program point L992-11(lines 992 996) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0)))) [2021-11-07 02:23:48,569 INFO L857 garLoopResultBuilder]: For program point L597(lines 597 599) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863-2(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863-4(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863-6(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863-8(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863-10(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,570 INFO L857 garLoopResultBuilder]: For program point L863-12(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L863-14(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L863-16(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L863-18(lines 863 869) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L336-1(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L336-3(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L336-5(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,571 INFO L857 garLoopResultBuilder]: For program point L336-7(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,572 INFO L857 garLoopResultBuilder]: For program point L336-9(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,572 INFO L857 garLoopResultBuilder]: For program point L336-11(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,572 INFO L857 garLoopResultBuilder]: For program point L336-13(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,572 INFO L857 garLoopResultBuilder]: For program point L336-15(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,572 INFO L857 garLoopResultBuilder]: For program point L336-17(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,572 INFO L857 garLoopResultBuilder]: For program point L336-19(lines 317 352) no Hoare annotation was computed. [2021-11-07 02:23:48,573 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,573 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,573 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,573 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,573 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,573 INFO L857 garLoopResultBuilder]: For program point L605(lines 605 610) no Hoare annotation was computed. [2021-11-07 02:23:48,574 INFO L857 garLoopResultBuilder]: For program point L605-2(lines 526 624) no Hoare annotation was computed. [2021-11-07 02:23:48,574 INFO L853 garLoopResultBuilder]: At program point L341(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,574 INFO L853 garLoopResultBuilder]: At program point L341-1(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,574 INFO L853 garLoopResultBuilder]: At program point L341-2(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,574 INFO L853 garLoopResultBuilder]: At program point L341-3(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,574 INFO L853 garLoopResultBuilder]: At program point L341-4(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,574 INFO L853 garLoopResultBuilder]: At program point L341-5(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,575 INFO L853 garLoopResultBuilder]: At program point L341-6(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,575 INFO L853 garLoopResultBuilder]: At program point L341-7(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,575 INFO L853 garLoopResultBuilder]: At program point L341-8(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,575 INFO L853 garLoopResultBuilder]: At program point L341-9(lines 341 350) the Hoare annotation is: false [2021-11-07 02:23:48,575 INFO L857 garLoopResultBuilder]: For program point L342(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,575 INFO L857 garLoopResultBuilder]: For program point L342-2(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-4(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-6(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-8(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-10(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-12(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-14(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,576 INFO L857 garLoopResultBuilder]: For program point L342-16(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,577 INFO L857 garLoopResultBuilder]: For program point L342-18(lines 342 348) no Hoare annotation was computed. [2021-11-07 02:23:48,577 INFO L853 garLoopResultBuilder]: At program point L79(lines 683 772) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (not (= 2 ~s~0)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~s~0 ~UNLOADED~0) (= ~customIrp~0 0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1))) [2021-11-07 02:23:48,577 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,577 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,577 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 02:23:48,577 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,578 INFO L853 garLoopResultBuilder]: At program point L351(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,578 INFO L853 garLoopResultBuilder]: At program point L351-1(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,578 INFO L853 garLoopResultBuilder]: At program point L351-2(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,578 INFO L853 garLoopResultBuilder]: At program point L351-3(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,578 INFO L853 garLoopResultBuilder]: At program point L351-4(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,578 INFO L853 garLoopResultBuilder]: At program point L351-5(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,579 INFO L853 garLoopResultBuilder]: At program point L351-6(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,579 INFO L853 garLoopResultBuilder]: At program point L351-7(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,579 INFO L853 garLoopResultBuilder]: At program point L351-8(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,579 INFO L853 garLoopResultBuilder]: At program point L351-9(lines 300 353) the Hoare annotation is: false [2021-11-07 02:23:48,579 INFO L857 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2021-11-07 02:23:48,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,580 INFO L857 garLoopResultBuilder]: For program point L881(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,580 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,580 INFO L853 garLoopResultBuilder]: At program point L881-1(lines 881 899) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,580 INFO L857 garLoopResultBuilder]: For program point L881-2(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,580 INFO L853 garLoopResultBuilder]: At program point L881-3(lines 881 899) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,580 INFO L857 garLoopResultBuilder]: For program point L881-4(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,581 INFO L853 garLoopResultBuilder]: At program point L881-5(lines 881 899) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,581 INFO L857 garLoopResultBuilder]: For program point L881-6(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,581 INFO L853 garLoopResultBuilder]: At program point L881-7(lines 881 899) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,581 INFO L857 garLoopResultBuilder]: For program point L881-8(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,582 INFO L853 garLoopResultBuilder]: At program point L617(lines 613 622) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (<= 0 .cse0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (<= .cse0 0)))) [2021-11-07 02:23:48,582 INFO L853 garLoopResultBuilder]: At program point L881-9(lines 881 899) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,582 INFO L857 garLoopResultBuilder]: For program point L881-10(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,582 INFO L853 garLoopResultBuilder]: At program point L881-11(lines 881 899) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,582 INFO L857 garLoopResultBuilder]: For program point L881-12(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,583 INFO L853 garLoopResultBuilder]: At program point L881-13(lines 881 899) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse0 (+ ULTIMATE.start_IofCallDriver_~compRetStatus~0 1073741802))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= 2 ~DC~0) (<= 0 .cse0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (<= .cse0 0) (= ~MPR1~0 ~s~0)))) [2021-11-07 02:23:48,583 INFO L857 garLoopResultBuilder]: For program point L881-14(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,583 INFO L853 garLoopResultBuilder]: At program point L881-15(lines 881 899) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,583 INFO L857 garLoopResultBuilder]: For program point L881-16(lines 881 899) no Hoare annotation was computed. [2021-11-07 02:23:48,583 INFO L853 garLoopResultBuilder]: At program point L881-17(lines 881 899) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,583 INFO L857 garLoopResultBuilder]: For program point L221(lines 221 227) no Hoare annotation was computed. [2021-11-07 02:23:48,584 INFO L853 garLoopResultBuilder]: At program point L882(lines 882 890) the Hoare annotation is: false [2021-11-07 02:23:48,584 INFO L857 garLoopResultBuilder]: For program point L882-2(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,584 INFO L853 garLoopResultBuilder]: At program point L882-3(lines 882 890) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,584 INFO L857 garLoopResultBuilder]: For program point L882-5(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,584 INFO L853 garLoopResultBuilder]: At program point L882-6(lines 882 890) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,585 INFO L857 garLoopResultBuilder]: For program point L882-8(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,585 INFO L853 garLoopResultBuilder]: At program point L882-9(lines 882 890) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,585 INFO L857 garLoopResultBuilder]: For program point L882-11(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,585 INFO L853 garLoopResultBuilder]: At program point L882-12(lines 882 890) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,585 INFO L857 garLoopResultBuilder]: For program point L882-14(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,585 INFO L853 garLoopResultBuilder]: At program point L882-15(lines 882 890) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,586 INFO L857 garLoopResultBuilder]: For program point L882-17(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,586 INFO L853 garLoopResultBuilder]: At program point L882-18(lines 882 890) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0))) [2021-11-07 02:23:48,586 INFO L857 garLoopResultBuilder]: For program point L882-20(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,586 INFO L853 garLoopResultBuilder]: At program point L882-21(lines 882 890) the Hoare annotation is: false [2021-11-07 02:23:48,586 INFO L857 garLoopResultBuilder]: For program point L882-23(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,586 INFO L853 garLoopResultBuilder]: At program point L882-24(lines 882 890) the Hoare annotation is: false [2021-11-07 02:23:48,587 INFO L857 garLoopResultBuilder]: For program point L882-26(lines 882 890) no Hoare annotation was computed. [2021-11-07 02:23:48,587 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,587 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,587 INFO L853 garLoopResultBuilder]: At program point L760(lines 683 772) the Hoare annotation is: (let ((.cse20 (<= |ULTIMATE.start_DiskPerfDispatchPnp_#res| 258)) (.cse11 (+ ~SKIP2~0 3)) (.cse17 (<= ULTIMATE.start_main_~status~6 258)) (.cse19 (<= ULTIMATE.start_DiskPerfDispatchPnp_~status~0 258))) (let ((.cse0 (= 2 ~DC~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse14 (<= 6 ~MPR3~0)) (.cse13 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse21 (or (<= 260 ULTIMATE.start_DiskPerfDispatchPnp_~status~0) .cse19)) (.cse9 (<= 7 ~IPC~0)) (.cse10 (not (= ~SKIP2~0 2))) (.cse22 (or .cse17 (<= 260 ULTIMATE.start_main_~status~6))) (.cse15 (= ~s~0 ~DC~0)) (.cse16 (= 2 ~s~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= .cse11 ~IPC~0)) (.cse18 (<= ULTIMATE.start_DiskPerfRemoveDevice_~status~2 258)) (.cse3 (= ~routine~0 0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (<= 4 ~SKIP2~0)) (.cse23 (or (<= 260 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse20))) (or (and (< ULTIMATE.start_main_~status~6 (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 ULTIMATE.start_PoCallDriver_~returnVal~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~6) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_PoCallDriver_~returnVal~0 ~lowerDriverReturn~0)) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse9 .cse10 .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 (<= .cse11 ~s~0) .cse3 .cse12 (= ~IPC~0 ~s~0)) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 (= ~lowerDriverReturn~0 |ULTIMATE.start_DiskPerfDispatchPnp_#res|) .cse7 .cse8) (and .cse13 .cse14 .cse9 .cse10 .cse15 .cse16 .cse17 .cse1 .cse18 .cse2 (or (= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 0) (= (+ ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 1073741637) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse19 .cse20) (and .cse13 .cse14 .cse21 .cse9 .cse10 .cse22 .cse15 .cse16 .cse1 .cse2 (or (<= ULTIMATE.start_DiskPerfStartDevice_~status~1 258) (<= 260 ULTIMATE.start_DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23) (and .cse9 .cse10 .cse15 .cse16 .cse1 .cse2 .cse3 (<= (+ 1073741789 ULTIMATE.start_main_~status~6) 0) (<= (+ 1073741789 |ULTIMATE.start_DiskPerfDeviceControl_#res|) 0)) (and .cse10 .cse15 .cse16 (= ULTIMATE.start_main_~status~6 0) .cse1 (not (= ~IPC~0 2)) .cse3) (and .cse13 .cse21 .cse9 .cse10 .cse22 .cse15 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0) (< 258 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) .cse16 .cse1 .cse2 (or (<= 260 ULTIMATE.start_DiskPerfRemoveDevice_~status~2) .cse18) .cse3 .cse4 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3 258) (<= 260 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse5 .cse6 (or (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259) (<= ULTIMATE.start_DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 ULTIMATE.start_DiskPerfForwardIrpSynchronous_~status~3)) .cse7 .cse23)))) [2021-11-07 02:23:48,587 INFO L857 garLoopResultBuilder]: For program point L1025(lines 1025 1045) no Hoare annotation was computed. [2021-11-07 02:23:48,588 INFO L853 garLoopResultBuilder]: At program point L1025-1(lines 1025 1045) the Hoare annotation is: (and (= 2 ~DC~0) (not (= ~pended~0 1)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~routine~0 0) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-11-07 02:23:48,588 INFO L857 garLoopResultBuilder]: For program point L893(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,588 INFO L857 garLoopResultBuilder]: For program point L893-2(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,588 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,588 INFO L857 garLoopResultBuilder]: For program point L893-4(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,588 INFO L857 garLoopResultBuilder]: For program point L893-6(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L857 garLoopResultBuilder]: For program point L893-8(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L857 garLoopResultBuilder]: For program point L893-10(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L857 garLoopResultBuilder]: For program point L893-12(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L857 garLoopResultBuilder]: For program point L893-14(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L857 garLoopResultBuilder]: For program point L893-16(lines 893 897) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 02:23:48,589 INFO L853 garLoopResultBuilder]: At program point L1026(lines 1026 1036) the Hoare annotation is: false [2021-11-07 02:23:48,593 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:48,595 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:23:48,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:23:48 BoogieIcfgContainer [2021-11-07 02:23:48,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:23:48,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:23:48,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:23:48,700 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:23:48,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:23:23" (3/4) ... [2021-11-07 02:23:48,711 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 02:23:48,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 267 nodes and edges [2021-11-07 02:23:48,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2021-11-07 02:23:48,771 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-11-07 02:23:48,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-07 02:23:48,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || s == UNLOADED) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) [2021-11-07 02:23:48,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || s == UNLOADED) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) [2021-11-07 02:23:48,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || s == UNLOADED) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) [2021-11-07 02:23:48,818 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1))) || (((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1)))) || ((!(2 == s) && 4 <= SKIP2) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && status <= 258) && status <= 258) && (status == 0 || status + 1073741637 == 0)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((7 <= IPC && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((7 <= IPC && !(2 == s)) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) [2021-11-07 02:23:48,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) [2021-11-07 02:23:48,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + \result <= 0) && compRegistered == 0) || ((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == \result) && IPC == s) && compRegistered == 0)) || (((((((((((s == DC && 2 == s) && status == 0) && \result == 0) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) [2021-11-07 02:23:48,840 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && s == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (260 <= status || status <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) && (260 <= \result || \result <= 258)) || (((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && compRetStatus + 1073741802 <= 0) && \result <= 258)) || (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (260 <= status || status <= 258)) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) && (260 <= \result || \result <= 258))) || (((((((((((returnVal2 <= lowerDriverReturn && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s) [2021-11-07 02:23:49,086 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:23:49,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:23:49,088 INFO L168 Benchmark]: Toolchain (without parser) took 29831.51 ms. Allocated memory was 92.3 MB in the beginning and 373.3 MB in the end (delta: 281.0 MB). Free memory was 67.3 MB in the beginning and 127.3 MB in the end (delta: -60.0 MB). Peak memory consumption was 217.7 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,090 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 92.3 MB. Free memory was 65.6 MB in the beginning and 65.6 MB in the end (delta: 38.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:23:49,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.80 ms. Allocated memory is still 92.3 MB. Free memory was 67.1 MB in the beginning and 56.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.51 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 56.9 MB in the beginning and 84.3 MB in the end (delta: -27.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,091 INFO L168 Benchmark]: Boogie Preprocessor took 154.52 ms. Allocated memory is still 111.1 MB. Free memory was 84.3 MB in the beginning and 78.2 MB in the end (delta: 6.1 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,092 INFO L168 Benchmark]: RCFGBuilder took 2975.17 ms. Allocated memory was 111.1 MB in the beginning and 165.7 MB in the end (delta: 54.5 MB). Free memory was 78.2 MB in the beginning and 125.3 MB in the end (delta: -47.1 MB). Peak memory consumption was 76.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,092 INFO L168 Benchmark]: TraceAbstraction took 25576.88 ms. Allocated memory was 165.7 MB in the beginning and 373.3 MB in the end (delta: 207.6 MB). Free memory was 125.3 MB in the beginning and 182.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 226.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,093 INFO L168 Benchmark]: Witness Printer took 386.58 ms. Allocated memory is still 373.3 MB. Free memory was 182.4 MB in the beginning and 127.3 MB in the end (delta: 55.1 MB). Peak memory consumption was 52.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:23:49,096 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 92.3 MB. Free memory was 65.6 MB in the beginning and 65.6 MB in the end (delta: 38.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 548.80 ms. Allocated memory is still 92.3 MB. Free memory was 67.1 MB in the beginning and 56.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 183.51 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 56.9 MB in the beginning and 84.3 MB in the end (delta: -27.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 154.52 ms. Allocated memory is still 111.1 MB. Free memory was 84.3 MB in the beginning and 78.2 MB in the end (delta: 6.1 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2975.17 ms. Allocated memory was 111.1 MB in the beginning and 165.7 MB in the end (delta: 54.5 MB). Free memory was 78.2 MB in the beginning and 125.3 MB in the end (delta: -47.1 MB). Peak memory consumption was 76.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25576.88 ms. Allocated memory was 165.7 MB in the beginning and 373.3 MB in the end (delta: 207.6 MB). Free memory was 125.3 MB in the beginning and 182.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 226.1 MB. Max. memory is 16.1 GB. * Witness Printer took 386.58 ms. Allocated memory is still 373.3 MB. Free memory was 182.4 MB in the beginning and 127.3 MB in the end (delta: 55.1 MB). Peak memory consumption was 52.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 364 locations, 51 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9823 SDtfs, 8520 SDslu, 11681 SDs, 0 SdLazy, 4154 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=5, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 1392 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 109 PreInvPairs, 294 NumberOfFragments, 9492 HoareAnnotationTreeSize, 109 FomulaSimplifications, 7385055 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 109 FomulaSimplificationsInter, 198249 FormulaSimplificationTreeSizeReductionInter, 11.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1085 NumberOfCodeBlocks, 1085 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 3220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 51 specifications checked. All of them hold - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: (((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || s == UNLOADED) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: ((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1))) || (((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && (status <= 258 || 260 <= status)) && (status <= 258 || 260 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1)))) || ((!(2 == s) && 4 <= SKIP2) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && status <= 258) && status <= 258) && (status == 0 || status + 1073741637 == 0)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258) && ((((((((((((((status < lowerDriverReturn + 1 && 7 <= IPC) && !(SKIP2 == 2)) && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && SKIP2 == s) && returnVal <= lowerDriverReturn) || ((((7 <= IPC && 3 <= SKIP1) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && SKIP1 + 2 <= MPR1) && NP == 1)))) || (((7 <= IPC && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((7 <= IPC && !(2 == s)) && (((((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) || ((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && routine == 0) && lowerDriverReturn == status))) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || !(s == 1)) - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: ((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: ((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || !(s == 1)) - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || !(s == 1)) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn <= returnVal && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && returnVal <= lowerDriverReturn - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) || ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) || (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && s == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (260 <= status || status <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || !(s == 1)) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && IPC == s) && compRegistered == 0 - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: (((((((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && !(2 == s)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && s == UNLOADED) && customIrp == 0) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0) && !(MPR3 == s)) && !(s == 1) - InvariantResult [Line: 683]: Loop Invariant Derived loop invariant: ((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && compRegistered == 0) || ((((((((((s == DC && 2 == s) && status == 0) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || !(s == 1)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (s == NP || MPR3 == s)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || !(s == 1)) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 1026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: (((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || s == UNLOADED) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 1024]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 647]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2) - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRegistered == 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && s == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (260 <= status || status <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) && (260 <= \result || \result <= 258)) || (((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && compRetStatus + 1073741802 <= 0) && \result <= 258)) || (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (260 <= status || status <= 258)) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) && (260 <= \result || \result <= 258))) || (((((((((((returnVal2 <= lowerDriverReturn && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && (260 <= status || status <= 258)) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) || ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && s == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && compRetStatus + 1073741802 <= 0)) || ((((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && (260 <= status || status <= 258)) && s == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && (260 <= status || status <= 258)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && compRetStatus + 1073741802 <= 0) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0) - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((2 == DC && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && s == NP) && routine == 0) && compRegistered == 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && setEventCalled == 1) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0) && (returnVal2 <= 258 || 259 < returnVal2) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + \result <= 0) && compRegistered == 0) || ((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == \result) && IPC == s) && compRegistered == 0)) || (((((((((((s == DC && 2 == s) && status == 0) && \result == 0) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && IPC == s) && compRegistered == 0 - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 341]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 6 <= MPR3) && 2 == DC) && 0 <= compRetStatus + 1073741802) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && !(pended == 1)) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && compRetStatus + 1073741802 <= 0 - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: (((((((((((((((((((status < lowerDriverReturn + 1 && lowerDriverReturn <= returnVal) && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= status) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && returnVal <= lowerDriverReturn) || (((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && 2 == DC) && lowerDriverReturn <= returnVal2) && !(pended == 1)) && SKIP2 + 3 <= s) && routine == 0) && lowerDriverReturn == status) && IPC == s)) || (((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && lowerDriverReturn == \result) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && 7 <= IPC) && !(SKIP2 == 2)) && s == DC) && 2 == s) && status <= 258) && !(pended == 1)) && status <= 258) && SKIP2 + 3 <= IPC) && (status == 0 || status + 1073741637 == 0)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && status <= 258) && \result <= 258)) || ((((((((((((((((lowerDriverReturn == returnVal2 && 6 <= MPR3) && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (status <= 258 || 260 <= status)) && routine == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && (260 <= \result || \result <= 258))) || s == UNLOADED) || ((((((((7 <= IPC && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && routine == 0) && 1073741789 + status <= 0) && 1073741789 + \result <= 0)) || ((((((!(SKIP2 == 2) && s == DC) && 2 == s) && status == 0) && !(pended == 1)) && !(IPC == 2)) && routine == 0)) || ((((((((((((((((((lowerDriverReturn == returnVal2 && (260 <= status || status <= 258)) && 7 <= IPC) && !(SKIP2 == 2)) && (status <= 258 || 260 <= status)) && s == DC) && (status <= __cil_tmp15 || 258 < __cil_tmp15)) && 2 == s) && !(pended == 1)) && SKIP2 + 3 <= IPC) && (260 <= status || status <= 258)) && routine == 0) && 3 <= SKIP1) && (status <= 258 || 260 <= status)) && SKIP1 + 2 <= MPR1) && NP == 1) && (__cil_tmp15 <= 259 || __cil_tmp15 <= status)) && 4 <= SKIP2) && (260 <= \result || \result <= 258)) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && routine == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-11-07 02:23:49,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63844f7f-f3c2-4f92-9c59-e8993582b093/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE