./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG --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 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:19:42,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:19:42,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:19:42,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:19:42,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:19:42,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:19:42,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:19:42,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:19:42,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:19:42,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:19:42,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:19:42,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:19:42,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:19:42,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:19:42,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:19:42,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:19:42,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:19:42,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:19:42,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:19:42,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:19:42,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:19:42,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:19:42,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:19:42,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:19:42,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:19:42,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:19:42,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:19:42,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:19:42,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:19:42,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:19:42,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:19:42,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:19:42,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:19:42,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:19:42,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:19:42,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:19:42,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:19:42,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:19:42,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:19:42,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:19:42,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:19:42,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:19:42,441 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:19:42,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:19:42,443 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:19:42,444 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:19:42,444 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:19:42,444 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:19:42,445 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:19:42,445 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:19:42,453 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:19:42,453 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:19:42,455 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:19:42,455 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:19:42,456 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:19:42,456 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:19:42,456 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:19:42,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:19:42,457 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:19:42,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:19:42,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:19:42,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:19:42,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:19:42,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:19:42,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:19:42,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:19:42,459 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:19:42,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:19:42,460 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:19:42,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:19:42,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:19:42,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:19:42,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:19:42,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:19:42,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:19:42,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:19:42,464 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:19:42,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:19:42,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:19:42,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:19:42,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:19:42,466 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_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/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_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG 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-10-29 05:19:42,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:19:42,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:19:42,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:19:42,878 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:19:42,879 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:19:42,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-10-29 05:19:42,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/data/bc4f83fdd/97a1d248d54049238c3bb66fa192e679/FLAGcdecbcbf6 [2021-10-29 05:19:43,636 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:19:43,637 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-10-29 05:19:43,657 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/data/bc4f83fdd/97a1d248d54049238c3bb66fa192e679/FLAGcdecbcbf6 [2021-10-29 05:19:43,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/data/bc4f83fdd/97a1d248d54049238c3bb66fa192e679 [2021-10-29 05:19:43,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:19:43,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:19:43,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:19:43,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:19:43,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:19:43,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:19:43" (1/1) ... [2021-10-29 05:19:43,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239c1af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:43, skipping insertion in model container [2021-10-29 05:19:43,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:19:43" (1/1) ... [2021-10-29 05:19:43,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:19:44,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:19:44,285 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_316755d5-e8fc-4ebe-8d20-85211260bab8/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-10-29 05:19:44,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:19:44,551 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:19:44,589 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_316755d5-e8fc-4ebe-8d20-85211260bab8/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-10-29 05:19:44,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:19:44,740 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:19:44,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44 WrapperNode [2021-10-29 05:19:44,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:19:44,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:19:44,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:19:44,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:19:44,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:44,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:44,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:19:44,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:19:44,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:19:44,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:19:44,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:44,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:44,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:44,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:45,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:45,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:45,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:45,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:19:45,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:19:45,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:19:45,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:19:45,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (1/1) ... [2021-10-29 05:19:45,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:19:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:19:45,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:19:45,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:19:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:19:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:19:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:19:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:19:45,577 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,600 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,606 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,620 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,626 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,632 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,639 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,644 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,645 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,652 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,656 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,658 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,663 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,701 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,703 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,707 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,710 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,717 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,720 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,724 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,729 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:45,734 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:19:47,154 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##674: assume !false; [2021-10-29 05:19:47,154 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##673: assume false; [2021-10-29 05:19:47,155 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##618: assume !false; [2021-10-29 05:19:47,155 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##617: assume false; [2021-10-29 05:19:47,155 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##296: assume !false; [2021-10-29 05:19:47,155 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##295: assume false; [2021-10-29 05:19:47,156 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##256: assume !false; [2021-10-29 05:19:47,156 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##255: assume false; [2021-10-29 05:19:47,156 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##217: assume !false; [2021-10-29 05:19:47,156 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##216: assume false; [2021-10-29 05:19:47,156 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##247: assume !false; [2021-10-29 05:19:47,157 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume false; [2021-10-29 05:19:47,157 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##724: assume !false; [2021-10-29 05:19:47,157 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##723: assume false; [2021-10-29 05:19:47,157 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-29 05:19:47,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-29 05:19:47,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##326: assume !false; [2021-10-29 05:19:47,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume false; [2021-10-29 05:19:47,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##335: assume !false; [2021-10-29 05:19:47,158 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume false; [2021-10-29 05:19:47,159 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##405: assume !false; [2021-10-29 05:19:47,159 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume false; [2021-10-29 05:19:47,159 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##412: assume false; [2021-10-29 05:19:47,159 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##413: assume !false; [2021-10-29 05:19:47,160 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##452: assume false; [2021-10-29 05:19:47,160 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##453: assume !false; [2021-10-29 05:19:47,160 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##483: assume !false; [2021-10-29 05:19:47,160 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##482: assume false; [2021-10-29 05:19:47,161 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##543: assume !false; [2021-10-29 05:19:47,161 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##542: assume false; [2021-10-29 05:19:47,161 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##98: assume !false; [2021-10-29 05:19:47,161 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume false; [2021-10-29 05:19:47,162 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume !false; [2021-10-29 05:19:47,162 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##172: assume !false; [2021-10-29 05:19:47,162 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume false; [2021-10-29 05:19:47,162 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2021-10-29 05:19:47,163 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2021-10-29 05:19:47,163 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: assume false; [2021-10-29 05:19:47,163 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##142: assume !false; [2021-10-29 05:19:47,163 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume false; [2021-10-29 05:19:47,163 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-10-29 05:19:47,164 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-10-29 05:19:47,164 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-29 05:19:47,164 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-29 05:19:48,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:19:48,809 INFO L299 CfgBuilder]: Removed 267 assume(true) statements. [2021-10-29 05:19:48,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:19:48 BoogieIcfgContainer [2021-10-29 05:19:48,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:19:48,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:19:48,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:19:48,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:19:48,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:19:43" (1/3) ... [2021-10-29 05:19:48,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77603afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:19:48, skipping insertion in model container [2021-10-29 05:19:48,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:19:44" (2/3) ... [2021-10-29 05:19:48,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77603afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:19:48, skipping insertion in model container [2021-10-29 05:19:48,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:19:48" (3/3) ... [2021-10-29 05:19:48,828 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-10-29 05:19:48,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:19:48,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2021-10-29 05:19:48,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:19:48,941 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-10-29 05:19:48,941 INFO L340 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2021-10-29 05:19:48,969 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-10-29 05:19:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 05:19:48,977 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:48,978 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 05:19:48,979 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-10-29 05:19:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash 116517462, now seen corresponding path program 1 times [2021-10-29 05:19:48,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:49,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523451958] [2021-10-29 05:19:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:49,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:49,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:49,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523451958] [2021-10-29 05:19:49,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523451958] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:49,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:49,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:49,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591343939] [2021-10-29 05:19:49,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:49,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:49,326 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-10-29 05:19:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:49,714 INFO L93 Difference]: Finished difference Result 757 states and 1133 transitions. [2021-10-29 05:19:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:49,716 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-10-29 05:19:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:49,735 INFO L225 Difference]: With dead ends: 757 [2021-10-29 05:19:49,735 INFO L226 Difference]: Without dead ends: 428 [2021-10-29 05:19:49,741 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-10-29 05:19:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-29 05:19:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2021-10-29 05:19:49,820 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-10-29 05:19:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 575 transitions. [2021-10-29 05:19:49,824 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 575 transitions. Word has length 6 [2021-10-29 05:19:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:49,825 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 575 transitions. [2021-10-29 05:19:49,825 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-10-29 05:19:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 575 transitions. [2021-10-29 05:19:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:19:49,827 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:49,827 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:49,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:19:49,828 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-10-29 05:19:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1927424465, now seen corresponding path program 1 times [2021-10-29 05:19:49,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:49,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736225814] [2021-10-29 05:19:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:49,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:49,878 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:49,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736225814] [2021-10-29 05:19:49,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736225814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:49,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:49,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:19:49,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353290] [2021-10-29 05:19:49,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:49,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:49,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:49,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:49,882 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-10-29 05:19:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:50,119 INFO L93 Difference]: Finished difference Result 442 states and 600 transitions. [2021-10-29 05:19:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:50,120 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-10-29 05:19:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:50,126 INFO L225 Difference]: With dead ends: 442 [2021-10-29 05:19:50,127 INFO L226 Difference]: Without dead ends: 420 [2021-10-29 05:19:50,128 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-10-29 05:19:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-10-29 05:19:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2021-10-29 05:19:50,184 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-10-29 05:19:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 574 transitions. [2021-10-29 05:19:50,192 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 574 transitions. Word has length 10 [2021-10-29 05:19:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:50,192 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 574 transitions. [2021-10-29 05:19:50,193 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-10-29 05:19:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 574 transitions. [2021-10-29 05:19:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:19:50,194 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:50,195 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:50,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:19:50,195 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-10-29 05:19:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1848847082, now seen corresponding path program 1 times [2021-10-29 05:19:50,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:50,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255124662] [2021-10-29 05:19:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:50,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:50,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:50,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255124662] [2021-10-29 05:19:50,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255124662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:50,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:50,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:50,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170317491] [2021-10-29 05:19:50,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:50,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:50,287 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-10-29 05:19:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:50,348 INFO L93 Difference]: Finished difference Result 838 states and 1150 transitions. [2021-10-29 05:19:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:50,349 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-10-29 05:19:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:50,353 INFO L225 Difference]: With dead ends: 838 [2021-10-29 05:19:50,353 INFO L226 Difference]: Without dead ends: 528 [2021-10-29 05:19:50,355 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-10-29 05:19:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-10-29 05:19:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 437. [2021-10-29 05:19:50,376 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-10-29 05:19:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 613 transitions. [2021-10-29 05:19:50,379 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 613 transitions. Word has length 10 [2021-10-29 05:19:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:50,379 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 613 transitions. [2021-10-29 05:19:50,379 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-10-29 05:19:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 613 transitions. [2021-10-29 05:19:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 05:19:50,381 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:50,382 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:50,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:19:50,382 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-10-29 05:19:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1198560619, now seen corresponding path program 1 times [2021-10-29 05:19:50,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:50,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215383000] [2021-10-29 05:19:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:50,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:50,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-10-29 05:19:50,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:50,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215383000] [2021-10-29 05:19:50,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215383000] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:50,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:50,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:50,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497666932] [2021-10-29 05:19:50,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:50,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:50,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:50,473 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-10-29 05:19:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:50,658 INFO L93 Difference]: Finished difference Result 437 states and 613 transitions. [2021-10-29 05:19:50,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:50,659 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-10-29 05:19:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:50,673 INFO L225 Difference]: With dead ends: 437 [2021-10-29 05:19:50,673 INFO L226 Difference]: Without dead ends: 433 [2021-10-29 05:19:50,674 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-10-29 05:19:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-10-29 05:19:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2021-10-29 05:19:50,694 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-10-29 05:19:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 609 transitions. [2021-10-29 05:19:50,697 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 609 transitions. Word has length 15 [2021-10-29 05:19:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:50,697 INFO L470 AbstractCegarLoop]: Abstraction has 433 states and 609 transitions. [2021-10-29 05:19:50,697 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-10-29 05:19:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 609 transitions. [2021-10-29 05:19:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 05:19:50,699 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:50,700 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:50,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:19:50,700 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-10-29 05:19:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -849382793, now seen corresponding path program 1 times [2021-10-29 05:19:50,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:50,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347396299] [2021-10-29 05:19:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:50,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:50,753 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:50,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347396299] [2021-10-29 05:19:50,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347396299] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:50,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:50,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:50,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717787499] [2021-10-29 05:19:50,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:50,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:50,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:50,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:50,756 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-10-29 05:19:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:50,916 INFO L93 Difference]: Finished difference Result 455 states and 635 transitions. [2021-10-29 05:19:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:50,917 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-10-29 05:19:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:50,921 INFO L225 Difference]: With dead ends: 455 [2021-10-29 05:19:50,921 INFO L226 Difference]: Without dead ends: 450 [2021-10-29 05:19:50,922 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-10-29 05:19:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-10-29 05:19:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2021-10-29 05:19:50,941 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-10-29 05:19:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 628 transitions. [2021-10-29 05:19:50,944 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 628 transitions. Word has length 15 [2021-10-29 05:19:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:50,944 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 628 transitions. [2021-10-29 05:19:50,945 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-10-29 05:19:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 628 transitions. [2021-10-29 05:19:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 05:19:50,947 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:50,947 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:50,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:19:50,948 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-10-29 05:19:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -848827688, now seen corresponding path program 1 times [2021-10-29 05:19:50,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:50,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101165665] [2021-10-29 05:19:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:50,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:51,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:51,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101165665] [2021-10-29 05:19:51,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101165665] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:51,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:51,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:51,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239519108] [2021-10-29 05:19:51,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:51,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:51,064 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-10-29 05:19:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:51,263 INFO L93 Difference]: Finished difference Result 458 states and 637 transitions. [2021-10-29 05:19:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:51,263 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-10-29 05:19:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:51,267 INFO L225 Difference]: With dead ends: 458 [2021-10-29 05:19:51,268 INFO L226 Difference]: Without dead ends: 450 [2021-10-29 05:19:51,268 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-10-29 05:19:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-10-29 05:19:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2021-10-29 05:19:51,295 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-10-29 05:19:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 627 transitions. [2021-10-29 05:19:51,298 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 627 transitions. Word has length 15 [2021-10-29 05:19:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:51,298 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 627 transitions. [2021-10-29 05:19:51,299 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-10-29 05:19:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 627 transitions. [2021-10-29 05:19:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 05:19:51,305 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:51,305 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:51,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:19:51,306 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-10-29 05:19:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:51,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1792507426, now seen corresponding path program 1 times [2021-10-29 05:19:51,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:51,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453050188] [2021-10-29 05:19:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:51,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:51,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-10-29 05:19:51,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:51,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453050188] [2021-10-29 05:19:51,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453050188] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:51,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:51,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:51,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422748211] [2021-10-29 05:19:51,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:51,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:51,473 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-10-29 05:19:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:51,532 INFO L93 Difference]: Finished difference Result 739 states and 1045 transitions. [2021-10-29 05:19:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:51,533 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-10-29 05:19:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:51,537 INFO L225 Difference]: With dead ends: 739 [2021-10-29 05:19:51,537 INFO L226 Difference]: Without dead ends: 385 [2021-10-29 05:19:51,539 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-10-29 05:19:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-10-29 05:19:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2021-10-29 05:19:51,569 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-10-29 05:19:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 531 transitions. [2021-10-29 05:19:51,574 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 531 transitions. Word has length 16 [2021-10-29 05:19:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:51,574 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 531 transitions. [2021-10-29 05:19:51,576 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-10-29 05:19:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 531 transitions. [2021-10-29 05:19:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 05:19:51,577 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:51,586 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:51,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:19:51,587 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-10-29 05:19:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash -560687335, now seen corresponding path program 1 times [2021-10-29 05:19:51,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:51,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801083184] [2021-10-29 05:19:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:51,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:51,683 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:51,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801083184] [2021-10-29 05:19:51,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801083184] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:51,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:51,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:51,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127321658] [2021-10-29 05:19:51,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:51,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:51,686 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-10-29 05:19:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:51,882 INFO L93 Difference]: Finished difference Result 396 states and 540 transitions. [2021-10-29 05:19:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:51,882 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-10-29 05:19:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:51,886 INFO L225 Difference]: With dead ends: 396 [2021-10-29 05:19:51,886 INFO L226 Difference]: Without dead ends: 388 [2021-10-29 05:19:51,887 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-10-29 05:19:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-29 05:19:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2021-10-29 05:19:51,912 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-10-29 05:19:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 530 transitions. [2021-10-29 05:19:51,915 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 530 transitions. Word has length 16 [2021-10-29 05:19:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:51,916 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 530 transitions. [2021-10-29 05:19:51,916 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-10-29 05:19:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 530 transitions. [2021-10-29 05:19:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 05:19:51,917 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:51,917 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:51,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:19:51,918 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-10-29 05:19:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -212819231, now seen corresponding path program 1 times [2021-10-29 05:19:51,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:51,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991971923] [2021-10-29 05:19:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:51,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:51,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:51,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991971923] [2021-10-29 05:19:51,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991971923] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:51,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:51,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:51,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110117077] [2021-10-29 05:19:51,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:51,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:51,991 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-10-29 05:19:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:52,031 INFO L93 Difference]: Finished difference Result 409 states and 559 transitions. [2021-10-29 05:19:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:52,031 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-10-29 05:19:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:52,036 INFO L225 Difference]: With dead ends: 409 [2021-10-29 05:19:52,036 INFO L226 Difference]: Without dead ends: 378 [2021-10-29 05:19:52,037 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-10-29 05:19:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-10-29 05:19:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2021-10-29 05:19:52,076 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-10-29 05:19:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 518 transitions. [2021-10-29 05:19:52,078 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 518 transitions. Word has length 17 [2021-10-29 05:19:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:52,079 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 518 transitions. [2021-10-29 05:19:52,079 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-10-29 05:19:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2021-10-29 05:19:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 05:19:52,080 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:52,080 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:19:52,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:19:52,081 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-10-29 05:19:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1992909950, now seen corresponding path program 1 times [2021-10-29 05:19:52,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:52,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252093073] [2021-10-29 05:19:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:52,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:52,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:52,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252093073] [2021-10-29 05:19:52,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252093073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:52,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:52,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:52,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014440949] [2021-10-29 05:19:52,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:52,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:52,153 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-10-29 05:19:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:52,199 INFO L93 Difference]: Finished difference Result 391 states and 530 transitions. [2021-10-29 05:19:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:52,200 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-10-29 05:19:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:52,203 INFO L225 Difference]: With dead ends: 391 [2021-10-29 05:19:52,203 INFO L226 Difference]: Without dead ends: 376 [2021-10-29 05:19:52,204 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-10-29 05:19:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-10-29 05:19:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2021-10-29 05:19:52,233 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-10-29 05:19:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 515 transitions. [2021-10-29 05:19:52,236 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 515 transitions. Word has length 18 [2021-10-29 05:19:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:52,236 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 515 transitions. [2021-10-29 05:19:52,236 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-10-29 05:19:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 515 transitions. [2021-10-29 05:19:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:19:52,237 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:52,238 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-10-29 05:19:52,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:19:52,238 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-10-29 05:19:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 485153018, now seen corresponding path program 1 times [2021-10-29 05:19:52,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:52,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980911326] [2021-10-29 05:19:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:52,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:52,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:52,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980911326] [2021-10-29 05:19:52,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980911326] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:52,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:52,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:52,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121465456] [2021-10-29 05:19:52,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:52,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:52,296 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-10-29 05:19:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:52,360 INFO L93 Difference]: Finished difference Result 470 states and 614 transitions. [2021-10-29 05:19:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:52,361 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-10-29 05:19:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:52,366 INFO L225 Difference]: With dead ends: 470 [2021-10-29 05:19:52,366 INFO L226 Difference]: Without dead ends: 307 [2021-10-29 05:19:52,367 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-10-29 05:19:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-10-29 05:19:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2021-10-29 05:19:52,392 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-10-29 05:19:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 376 transitions. [2021-10-29 05:19:52,394 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 376 transitions. Word has length 19 [2021-10-29 05:19:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:52,395 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 376 transitions. [2021-10-29 05:19:52,395 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-10-29 05:19:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 376 transitions. [2021-10-29 05:19:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:19:52,396 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:52,397 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-10-29 05:19:52,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:19:52,398 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-10-29 05:19:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash 416106724, now seen corresponding path program 1 times [2021-10-29 05:19:52,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:52,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561970786] [2021-10-29 05:19:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:52,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:52,451 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:52,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561970786] [2021-10-29 05:19:52,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561970786] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:52,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:52,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:52,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487230116] [2021-10-29 05:19:52,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:52,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:52,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:52,456 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-10-29 05:19:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:52,688 INFO L93 Difference]: Finished difference Result 449 states and 578 transitions. [2021-10-29 05:19:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:52,689 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-10-29 05:19:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:52,693 INFO L225 Difference]: With dead ends: 449 [2021-10-29 05:19:52,693 INFO L226 Difference]: Without dead ends: 441 [2021-10-29 05:19:52,694 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-10-29 05:19:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-10-29 05:19:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 304. [2021-10-29 05:19:52,719 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-10-29 05:19:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 387 transitions. [2021-10-29 05:19:52,721 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 387 transitions. Word has length 20 [2021-10-29 05:19:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:52,723 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 387 transitions. [2021-10-29 05:19:52,723 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-10-29 05:19:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 387 transitions. [2021-10-29 05:19:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:19:52,724 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:52,725 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-10-29 05:19:52,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:19:52,725 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-10-29 05:19:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2112070836, now seen corresponding path program 1 times [2021-10-29 05:19:52,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:52,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878387915] [2021-10-29 05:19:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:52,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:52,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:52,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878387915] [2021-10-29 05:19:52,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878387915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:52,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:52,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:52,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355133639] [2021-10-29 05:19:52,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:52,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:52,784 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-10-29 05:19:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:52,965 INFO L93 Difference]: Finished difference Result 515 states and 667 transitions. [2021-10-29 05:19:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:52,966 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-10-29 05:19:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:52,969 INFO L225 Difference]: With dead ends: 515 [2021-10-29 05:19:52,969 INFO L226 Difference]: Without dead ends: 310 [2021-10-29 05:19:52,970 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-10-29 05:19:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-29 05:19:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2021-10-29 05:19:52,995 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-10-29 05:19:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 395 transitions. [2021-10-29 05:19:52,997 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 395 transitions. Word has length 20 [2021-10-29 05:19:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:52,997 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 395 transitions. [2021-10-29 05:19:52,998 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-10-29 05:19:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 395 transitions. [2021-10-29 05:19:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:19:52,999 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:52,999 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-10-29 05:19:52,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:19:53,000 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-10-29 05:19:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:53,001 INFO L85 PathProgramCache]: Analyzing trace with hash 31998246, now seen corresponding path program 1 times [2021-10-29 05:19:53,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:53,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022276711] [2021-10-29 05:19:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:53,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:53,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:53,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022276711] [2021-10-29 05:19:53,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022276711] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:53,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:53,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:53,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742015289] [2021-10-29 05:19:53,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:53,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:53,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:53,068 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-10-29 05:19:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:53,369 INFO L93 Difference]: Finished difference Result 455 states and 585 transitions. [2021-10-29 05:19:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:53,369 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-10-29 05:19:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:53,373 INFO L225 Difference]: With dead ends: 455 [2021-10-29 05:19:53,373 INFO L226 Difference]: Without dead ends: 447 [2021-10-29 05:19:53,375 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-10-29 05:19:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-10-29 05:19:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 310. [2021-10-29 05:19:53,431 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-10-29 05:19:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 394 transitions. [2021-10-29 05:19:53,435 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 394 transitions. Word has length 21 [2021-10-29 05:19:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:53,436 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 394 transitions. [2021-10-29 05:19:53,436 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-10-29 05:19:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2021-10-29 05:19:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:19:53,439 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:53,439 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-10-29 05:19:53,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 05:19:53,440 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-10-29 05:19:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 458626303, now seen corresponding path program 1 times [2021-10-29 05:19:53,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:53,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978496187] [2021-10-29 05:19:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:53,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:53,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:53,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978496187] [2021-10-29 05:19:53,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978496187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:53,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:53,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:19:53,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287222135] [2021-10-29 05:19:53,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:19:53,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:19:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:19:53,544 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-10-29 05:19:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:53,758 INFO L93 Difference]: Finished difference Result 373 states and 457 transitions. [2021-10-29 05:19:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:19:53,759 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-10-29 05:19:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:53,764 INFO L225 Difference]: With dead ends: 373 [2021-10-29 05:19:53,764 INFO L226 Difference]: Without dead ends: 369 [2021-10-29 05:19:53,767 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-10-29 05:19:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-10-29 05:19:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 317. [2021-10-29 05:19:53,805 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-10-29 05:19:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 401 transitions. [2021-10-29 05:19:53,807 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 401 transitions. Word has length 22 [2021-10-29 05:19:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:53,808 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 401 transitions. [2021-10-29 05:19:53,808 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-10-29 05:19:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 401 transitions. [2021-10-29 05:19:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:19:53,812 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:53,812 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-10-29 05:19:53,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 05:19:53,813 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-10-29 05:19:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 458614387, now seen corresponding path program 1 times [2021-10-29 05:19:53,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:53,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339359753] [2021-10-29 05:19:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:53,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:53,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:53,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339359753] [2021-10-29 05:19:53,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339359753] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:53,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:53,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:53,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687341209] [2021-10-29 05:19:53,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:53,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:53,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:53,905 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-10-29 05:19:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:54,175 INFO L93 Difference]: Finished difference Result 453 states and 584 transitions. [2021-10-29 05:19:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:54,176 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-10-29 05:19:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:54,180 INFO L225 Difference]: With dead ends: 453 [2021-10-29 05:19:54,180 INFO L226 Difference]: Without dead ends: 431 [2021-10-29 05:19:54,181 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-10-29 05:19:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-10-29 05:19:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 302. [2021-10-29 05:19:54,211 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-10-29 05:19:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 384 transitions. [2021-10-29 05:19:54,213 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 384 transitions. Word has length 22 [2021-10-29 05:19:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:54,214 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 384 transitions. [2021-10-29 05:19:54,214 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-10-29 05:19:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 384 transitions. [2021-10-29 05:19:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:19:54,215 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:54,216 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-10-29 05:19:54,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 05:19:54,216 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-10-29 05:19:54,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash -535361200, now seen corresponding path program 1 times [2021-10-29 05:19:54,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:54,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472145967] [2021-10-29 05:19:54,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:54,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:54,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-10-29 05:19:54,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:54,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472145967] [2021-10-29 05:19:54,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472145967] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:54,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:54,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:54,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257014211] [2021-10-29 05:19:54,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:54,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:54,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:54,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:54,278 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-10-29 05:19:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:54,492 INFO L93 Difference]: Finished difference Result 401 states and 512 transitions. [2021-10-29 05:19:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:54,492 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-10-29 05:19:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:54,497 INFO L225 Difference]: With dead ends: 401 [2021-10-29 05:19:54,497 INFO L226 Difference]: Without dead ends: 389 [2021-10-29 05:19:54,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-10-29 05:19:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-10-29 05:19:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 314. [2021-10-29 05:19:54,550 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-10-29 05:19:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 402 transitions. [2021-10-29 05:19:54,552 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 402 transitions. Word has length 22 [2021-10-29 05:19:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:54,552 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 402 transitions. [2021-10-29 05:19:54,552 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-10-29 05:19:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 402 transitions. [2021-10-29 05:19:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:19:54,553 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:54,553 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-10-29 05:19:54,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:19:54,554 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-10-29 05:19:54,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1018175500, now seen corresponding path program 1 times [2021-10-29 05:19:54,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:54,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146302153] [2021-10-29 05:19:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:54,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:54,694 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:54,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146302153] [2021-10-29 05:19:54,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146302153] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:54,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:54,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:19:54,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761179678] [2021-10-29 05:19:54,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:54,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:54,697 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-10-29 05:19:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:54,823 INFO L93 Difference]: Finished difference Result 518 states and 668 transitions. [2021-10-29 05:19:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:54,824 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-10-29 05:19:54,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:54,827 INFO L225 Difference]: With dead ends: 518 [2021-10-29 05:19:54,827 INFO L226 Difference]: Without dead ends: 291 [2021-10-29 05:19:54,828 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-10-29 05:19:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-10-29 05:19:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 278. [2021-10-29 05:19:54,867 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-10-29 05:19:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 348 transitions. [2021-10-29 05:19:54,869 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 348 transitions. Word has length 22 [2021-10-29 05:19:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:54,869 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 348 transitions. [2021-10-29 05:19:54,869 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-10-29 05:19:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 348 transitions. [2021-10-29 05:19:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:19:54,871 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:54,871 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-10-29 05:19:54,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 05:19:54,871 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-10-29 05:19:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -931079678, now seen corresponding path program 1 times [2021-10-29 05:19:54,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:54,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651653906] [2021-10-29 05:19:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:54,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:54,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:54,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651653906] [2021-10-29 05:19:54,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651653906] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:54,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:54,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:19:54,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961773759] [2021-10-29 05:19:54,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:19:54,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:19:54,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:19:54,920 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-10-29 05:19:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:55,015 INFO L93 Difference]: Finished difference Result 307 states and 376 transitions. [2021-10-29 05:19:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:19:55,016 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-10-29 05:19:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:55,019 INFO L225 Difference]: With dead ends: 307 [2021-10-29 05:19:55,019 INFO L226 Difference]: Without dead ends: 276 [2021-10-29 05:19:55,019 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-10-29 05:19:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-29 05:19:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-10-29 05:19:55,057 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-10-29 05:19:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 344 transitions. [2021-10-29 05:19:55,059 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 344 transitions. Word has length 23 [2021-10-29 05:19:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:55,059 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 344 transitions. [2021-10-29 05:19:55,060 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-10-29 05:19:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 344 transitions. [2021-10-29 05:19:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:19:55,061 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:55,061 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-10-29 05:19:55,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 05:19:55,062 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-10-29 05:19:55,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash 945040085, now seen corresponding path program 1 times [2021-10-29 05:19:55,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:55,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558077269] [2021-10-29 05:19:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:55,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:55,101 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:55,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558077269] [2021-10-29 05:19:55,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558077269] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:55,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:55,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:55,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578028790] [2021-10-29 05:19:55,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:55,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:55,104 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-10-29 05:19:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:55,289 INFO L93 Difference]: Finished difference Result 301 states and 370 transitions. [2021-10-29 05:19:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:55,290 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-10-29 05:19:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:55,293 INFO L225 Difference]: With dead ends: 301 [2021-10-29 05:19:55,293 INFO L226 Difference]: Without dead ends: 276 [2021-10-29 05:19:55,294 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-10-29 05:19:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-29 05:19:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-10-29 05:19:55,334 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-10-29 05:19:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 342 transitions. [2021-10-29 05:19:55,336 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 342 transitions. Word has length 23 [2021-10-29 05:19:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:55,336 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 342 transitions. [2021-10-29 05:19:55,337 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-10-29 05:19:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 342 transitions. [2021-10-29 05:19:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:19:55,338 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:55,338 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-10-29 05:19:55,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:19:55,339 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-10-29 05:19:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 968947937, now seen corresponding path program 1 times [2021-10-29 05:19:55,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:55,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466686440] [2021-10-29 05:19:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:55,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:55,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:55,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466686440] [2021-10-29 05:19:55,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466686440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:55,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:55,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:55,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897257556] [2021-10-29 05:19:55,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:55,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:55,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:55,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:55,407 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-10-29 05:19:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:55,628 INFO L93 Difference]: Finished difference Result 467 states and 588 transitions. [2021-10-29 05:19:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:55,629 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-10-29 05:19:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:55,631 INFO L225 Difference]: With dead ends: 467 [2021-10-29 05:19:55,631 INFO L226 Difference]: Without dead ends: 276 [2021-10-29 05:19:55,632 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-10-29 05:19:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-29 05:19:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-10-29 05:19:55,673 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-10-29 05:19:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 336 transitions. [2021-10-29 05:19:55,675 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 336 transitions. Word has length 23 [2021-10-29 05:19:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:55,676 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 336 transitions. [2021-10-29 05:19:55,676 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-10-29 05:19:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 336 transitions. [2021-10-29 05:19:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:19:55,677 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:55,677 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-10-29 05:19:55,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:19:55,678 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-10-29 05:19:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash -239413340, now seen corresponding path program 1 times [2021-10-29 05:19:55,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:55,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364736708] [2021-10-29 05:19:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:55,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:55,712 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:55,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364736708] [2021-10-29 05:19:55,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364736708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:55,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:55,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:55,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845102433] [2021-10-29 05:19:55,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:55,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:55,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:55,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:55,715 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-10-29 05:19:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:55,857 INFO L93 Difference]: Finished difference Result 292 states and 348 transitions. [2021-10-29 05:19:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:55,863 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-10-29 05:19:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:55,865 INFO L225 Difference]: With dead ends: 292 [2021-10-29 05:19:55,865 INFO L226 Difference]: Without dead ends: 278 [2021-10-29 05:19:55,867 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-10-29 05:19:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-29 05:19:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2021-10-29 05:19:55,909 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-10-29 05:19:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 330 transitions. [2021-10-29 05:19:55,911 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 330 transitions. Word has length 24 [2021-10-29 05:19:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:55,911 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 330 transitions. [2021-10-29 05:19:55,911 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-10-29 05:19:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 330 transitions. [2021-10-29 05:19:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:19:55,912 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:55,912 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-10-29 05:19:55,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 05:19:55,913 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-10-29 05:19:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash -823629734, now seen corresponding path program 1 times [2021-10-29 05:19:55,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:55,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035965901] [2021-10-29 05:19:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:55,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:55,970 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:55,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035965901] [2021-10-29 05:19:55,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035965901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:55,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:55,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:55,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582429431] [2021-10-29 05:19:55,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:55,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:55,978 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-10-29 05:19:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:56,151 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2021-10-29 05:19:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:56,152 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-10-29 05:19:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:56,154 INFO L225 Difference]: With dead ends: 275 [2021-10-29 05:19:56,154 INFO L226 Difference]: Without dead ends: 260 [2021-10-29 05:19:56,155 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-10-29 05:19:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-10-29 05:19:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2021-10-29 05:19:56,194 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-10-29 05:19:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 316 transitions. [2021-10-29 05:19:56,195 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 316 transitions. Word has length 24 [2021-10-29 05:19:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:56,196 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 316 transitions. [2021-10-29 05:19:56,196 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-10-29 05:19:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 316 transitions. [2021-10-29 05:19:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:19:56,197 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:56,198 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-10-29 05:19:56,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:19:56,198 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-10-29 05:19:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1209473865, now seen corresponding path program 1 times [2021-10-29 05:19:56,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:56,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57189212] [2021-10-29 05:19:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:56,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:56,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-10-29 05:19:56,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:56,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57189212] [2021-10-29 05:19:56,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57189212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:56,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:56,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:19:56,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493225031] [2021-10-29 05:19:56,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:19:56,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:19:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:19:56,272 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-10-29 05:19:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:56,555 INFO L93 Difference]: Finished difference Result 281 states and 338 transitions. [2021-10-29 05:19:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:19:56,556 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-10-29 05:19:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:56,559 INFO L225 Difference]: With dead ends: 281 [2021-10-29 05:19:56,559 INFO L226 Difference]: Without dead ends: 275 [2021-10-29 05:19:56,560 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-10-29 05:19:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-10-29 05:19:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2021-10-29 05:19:56,634 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-10-29 05:19:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 316 transitions. [2021-10-29 05:19:56,636 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 316 transitions. Word has length 24 [2021-10-29 05:19:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:56,637 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 316 transitions. [2021-10-29 05:19:56,637 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-10-29 05:19:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 316 transitions. [2021-10-29 05:19:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:19:56,638 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:56,638 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-10-29 05:19:56,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 05:19:56,639 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-10-29 05:19:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1185712742, now seen corresponding path program 1 times [2021-10-29 05:19:56,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:56,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460463545] [2021-10-29 05:19:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:56,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:56,701 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:56,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460463545] [2021-10-29 05:19:56,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460463545] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:56,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:56,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:19:56,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031055001] [2021-10-29 05:19:56,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:56,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:56,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:56,706 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-10-29 05:19:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:56,800 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2021-10-29 05:19:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:56,800 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-10-29 05:19:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:56,803 INFO L225 Difference]: With dead ends: 274 [2021-10-29 05:19:56,803 INFO L226 Difference]: Without dead ends: 271 [2021-10-29 05:19:56,804 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-10-29 05:19:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-29 05:19:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 266. [2021-10-29 05:19:56,844 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-10-29 05:19:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 322 transitions. [2021-10-29 05:19:56,846 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 322 transitions. Word has length 25 [2021-10-29 05:19:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:56,847 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 322 transitions. [2021-10-29 05:19:56,847 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-10-29 05:19:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 322 transitions. [2021-10-29 05:19:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:19:56,848 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:56,848 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-10-29 05:19:56,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 05:19:56,849 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-10-29 05:19:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1185700826, now seen corresponding path program 1 times [2021-10-29 05:19:56,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:56,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483709038] [2021-10-29 05:19:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:56,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:56,919 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:56,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483709038] [2021-10-29 05:19:56,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483709038] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:56,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:56,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:56,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826064446] [2021-10-29 05:19:56,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:56,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:56,923 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-10-29 05:19:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:57,092 INFO L93 Difference]: Finished difference Result 271 states and 326 transitions. [2021-10-29 05:19:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:57,092 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-10-29 05:19:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:57,094 INFO L225 Difference]: With dead ends: 271 [2021-10-29 05:19:57,095 INFO L226 Difference]: Without dead ends: 251 [2021-10-29 05:19:57,095 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-10-29 05:19:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-29 05:19:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-29 05:19:57,138 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-10-29 05:19:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2021-10-29 05:19:57,140 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 25 [2021-10-29 05:19:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:57,140 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2021-10-29 05:19:57,141 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-10-29 05:19:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2021-10-29 05:19:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:19:57,142 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:57,142 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-10-29 05:19:57,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 05:19:57,143 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-10-29 05:19:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash 974701212, now seen corresponding path program 1 times [2021-10-29 05:19:57,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:57,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553195374] [2021-10-29 05:19:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:57,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:57,203 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:57,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553195374] [2021-10-29 05:19:57,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553195374] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:57,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:57,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:19:57,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621083111] [2021-10-29 05:19:57,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:19:57,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:19:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:19:57,205 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-10-29 05:19:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:57,287 INFO L93 Difference]: Finished difference Result 456 states and 557 transitions. [2021-10-29 05:19:57,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:19:57,288 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-10-29 05:19:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:57,290 INFO L225 Difference]: With dead ends: 456 [2021-10-29 05:19:57,290 INFO L226 Difference]: Without dead ends: 277 [2021-10-29 05:19:57,291 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-10-29 05:19:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-29 05:19:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 227. [2021-10-29 05:19:57,325 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-10-29 05:19:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2021-10-29 05:19:57,327 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 25 [2021-10-29 05:19:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:57,328 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2021-10-29 05:19:57,328 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-10-29 05:19:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2021-10-29 05:19:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:19:57,329 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:57,329 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-10-29 05:19:57,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 05:19:57,330 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-10-29 05:19:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 550346227, now seen corresponding path program 1 times [2021-10-29 05:19:57,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:57,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437144952] [2021-10-29 05:19:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:57,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:57,375 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:57,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437144952] [2021-10-29 05:19:57,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437144952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:57,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:57,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:19:57,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989940851] [2021-10-29 05:19:57,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:19:57,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:19:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:19:57,378 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-10-29 05:19:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:57,476 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2021-10-29 05:19:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:19:57,477 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-10-29 05:19:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:57,479 INFO L225 Difference]: With dead ends: 240 [2021-10-29 05:19:57,479 INFO L226 Difference]: Without dead ends: 217 [2021-10-29 05:19:57,480 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-10-29 05:19:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-29 05:19:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-10-29 05:19:57,523 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-10-29 05:19:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2021-10-29 05:19:57,525 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 27 [2021-10-29 05:19:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:57,525 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2021-10-29 05:19:57,525 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-10-29 05:19:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2021-10-29 05:19:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:19:57,526 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:57,527 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-10-29 05:19:57,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 05:19:57,527 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-10-29 05:19:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1862601964, now seen corresponding path program 1 times [2021-10-29 05:19:57,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:57,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758131039] [2021-10-29 05:19:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:57,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:57,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:57,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758131039] [2021-10-29 05:19:57,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758131039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:57,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:57,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:19:57,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518038663] [2021-10-29 05:19:57,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:19:57,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:57,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:19:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:19:57,586 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-10-29 05:19:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:57,722 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2021-10-29 05:19:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:19:57,723 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-10-29 05:19:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:57,725 INFO L225 Difference]: With dead ends: 217 [2021-10-29 05:19:57,725 INFO L226 Difference]: Without dead ends: 197 [2021-10-29 05:19:57,727 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-10-29 05:19:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-10-29 05:19:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-10-29 05:19:57,763 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-10-29 05:19:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 237 transitions. [2021-10-29 05:19:57,765 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 237 transitions. Word has length 27 [2021-10-29 05:19:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:57,765 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 237 transitions. [2021-10-29 05:19:57,765 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-10-29 05:19:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2021-10-29 05:19:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:19:57,766 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:57,767 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-10-29 05:19:57,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 05:19:57,767 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-10-29 05:19:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash 324272811, now seen corresponding path program 1 times [2021-10-29 05:19:57,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:57,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137987470] [2021-10-29 05:19:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:57,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:57,815 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:57,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137987470] [2021-10-29 05:19:57,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137987470] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:57,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:57,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:19:57,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412664214] [2021-10-29 05:19:57,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:19:57,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:19:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:19:57,818 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-10-29 05:19:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:57,977 INFO L93 Difference]: Finished difference Result 246 states and 297 transitions. [2021-10-29 05:19:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:19:57,978 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-10-29 05:19:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:57,980 INFO L225 Difference]: With dead ends: 246 [2021-10-29 05:19:57,980 INFO L226 Difference]: Without dead ends: 234 [2021-10-29 05:19:57,981 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-10-29 05:19:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-10-29 05:19:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2021-10-29 05:19:58,011 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-10-29 05:19:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 217 transitions. [2021-10-29 05:19:58,013 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 217 transitions. Word has length 28 [2021-10-29 05:19:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:58,013 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 217 transitions. [2021-10-29 05:19:58,014 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-10-29 05:19:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 217 transitions. [2021-10-29 05:19:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 05:19:58,015 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:58,015 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-10-29 05:19:58,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 05:19:58,017 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-10-29 05:19:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash 720400468, now seen corresponding path program 1 times [2021-10-29 05:19:58,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:58,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914909478] [2021-10-29 05:19:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:58,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:58,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:58,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914909478] [2021-10-29 05:19:58,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914909478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:58,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:58,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:19:58,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674442138] [2021-10-29 05:19:58,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:19:58,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:58,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:19:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:19:58,130 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-10-29 05:19:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:58,372 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2021-10-29 05:19:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:19:58,373 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-10-29 05:19:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:58,375 INFO L225 Difference]: With dead ends: 231 [2021-10-29 05:19:58,375 INFO L226 Difference]: Without dead ends: 227 [2021-10-29 05:19:58,375 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-10-29 05:19:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-10-29 05:19:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 168. [2021-10-29 05:19:58,408 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-10-29 05:19:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2021-10-29 05:19:58,411 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 37 [2021-10-29 05:19:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:58,412 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2021-10-29 05:19:58,412 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-10-29 05:19:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2021-10-29 05:19:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 05:19:58,413 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:58,413 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-10-29 05:19:58,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 05:19:58,414 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-10-29 05:19:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1886892860, now seen corresponding path program 1 times [2021-10-29 05:19:58,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:58,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403100756] [2021-10-29 05:19:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:58,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:58,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-10-29 05:19:58,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:58,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403100756] [2021-10-29 05:19:58,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403100756] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:58,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:58,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 05:19:58,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750599220] [2021-10-29 05:19:58,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 05:19:58,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 05:19:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-29 05:19:58,596 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-10-29 05:19:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:19:58,931 INFO L93 Difference]: Finished difference Result 307 states and 371 transitions. [2021-10-29 05:19:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:19:58,932 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-10-29 05:19:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:19:58,934 INFO L225 Difference]: With dead ends: 307 [2021-10-29 05:19:58,934 INFO L226 Difference]: Without dead ends: 289 [2021-10-29 05:19:58,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-29 05:19:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-29 05:19:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 168. [2021-10-29 05:19:58,971 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-10-29 05:19:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2021-10-29 05:19:58,973 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 38 [2021-10-29 05:19:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:19:58,973 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2021-10-29 05:19:58,974 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-10-29 05:19:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2021-10-29 05:19:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-29 05:19:58,975 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:19:58,975 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-10-29 05:19:58,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 05:19:58,975 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-10-29 05:19:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:19:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 294429223, now seen corresponding path program 1 times [2021-10-29 05:19:58,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:19:58,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098530647] [2021-10-29 05:19:58,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:19:58,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:19:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:19:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:19:59,203 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:19:59,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098530647] [2021-10-29 05:19:59,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098530647] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:19:59,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:19:59,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 05:19:59,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569611092] [2021-10-29 05:19:59,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 05:19:59,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:19:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 05:19:59,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-29 05:19:59,205 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-10-29 05:20:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:00,750 INFO L93 Difference]: Finished difference Result 380 states and 464 transitions. [2021-10-29 05:20:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-29 05:20:00,751 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-10-29 05:20:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:00,753 INFO L225 Difference]: With dead ends: 380 [2021-10-29 05:20:00,754 INFO L226 Difference]: Without dead ends: 316 [2021-10-29 05:20:00,758 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2021-10-29 05:20:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-29 05:20:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 256. [2021-10-29 05:20:00,815 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-10-29 05:20:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 310 transitions. [2021-10-29 05:20:00,818 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 310 transitions. Word has length 39 [2021-10-29 05:20:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:00,819 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 310 transitions. [2021-10-29 05:20:00,819 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-10-29 05:20:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 310 transitions. [2021-10-29 05:20:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-29 05:20:00,820 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:00,820 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-10-29 05:20:00,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 05:20:00,821 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-10-29 05:20:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:00,821 INFO L85 PathProgramCache]: Analyzing trace with hash 871358399, now seen corresponding path program 1 times [2021-10-29 05:20:00,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:00,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341145079] [2021-10-29 05:20:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:00,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:00,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-10-29 05:20:00,900 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:00,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341145079] [2021-10-29 05:20:00,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341145079] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:00,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:00,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:20:00,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790925517] [2021-10-29 05:20:00,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:20:00,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:20:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:00,904 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-10-29 05:20:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:01,048 INFO L93 Difference]: Finished difference Result 479 states and 575 transitions. [2021-10-29 05:20:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:20:01,049 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-10-29 05:20:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:01,052 INFO L225 Difference]: With dead ends: 479 [2021-10-29 05:20:01,052 INFO L226 Difference]: Without dead ends: 353 [2021-10-29 05:20:01,053 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-10-29 05:20:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-29 05:20:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2021-10-29 05:20:01,112 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-10-29 05:20:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 308 transitions. [2021-10-29 05:20:01,114 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 308 transitions. Word has length 41 [2021-10-29 05:20:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:01,115 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 308 transitions. [2021-10-29 05:20:01,115 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-10-29 05:20:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 308 transitions. [2021-10-29 05:20:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-29 05:20:01,116 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:01,116 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-10-29 05:20:01,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 05:20:01,117 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-10-29 05:20:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1142702850, now seen corresponding path program 1 times [2021-10-29 05:20:01,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:01,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096680014] [2021-10-29 05:20:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:01,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:01,211 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:01,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096680014] [2021-10-29 05:20:01,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096680014] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:01,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:01,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 05:20:01,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488117955] [2021-10-29 05:20:01,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 05:20:01,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 05:20:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-29 05:20:01,215 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-10-29 05:20:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:01,435 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2021-10-29 05:20:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 05:20:01,436 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-10-29 05:20:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:01,438 INFO L225 Difference]: With dead ends: 277 [2021-10-29 05:20:01,438 INFO L226 Difference]: Without dead ends: 240 [2021-10-29 05:20:01,442 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-10-29 05:20:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-29 05:20:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2021-10-29 05:20:01,500 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-10-29 05:20:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2021-10-29 05:20:01,502 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 41 [2021-10-29 05:20:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:01,502 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2021-10-29 05:20:01,502 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-10-29 05:20:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2021-10-29 05:20:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 05:20:01,503 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:01,503 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-10-29 05:20:01,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 05:20:01,504 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-10-29 05:20:01,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1246147497, now seen corresponding path program 1 times [2021-10-29 05:20:01,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:01,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599847949] [2021-10-29 05:20:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:01,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:01,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:01,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599847949] [2021-10-29 05:20:01,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599847949] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:01,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:01,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 05:20:01,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758678468] [2021-10-29 05:20:01,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 05:20:01,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 05:20:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-29 05:20:01,659 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-10-29 05:20:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:01,865 INFO L93 Difference]: Finished difference Result 240 states and 287 transitions. [2021-10-29 05:20:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 05:20:01,866 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-10-29 05:20:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:01,867 INFO L225 Difference]: With dead ends: 240 [2021-10-29 05:20:01,868 INFO L226 Difference]: Without dead ends: 213 [2021-10-29 05:20:01,869 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-10-29 05:20:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-29 05:20:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2021-10-29 05:20:01,932 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-10-29 05:20:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2021-10-29 05:20:01,933 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 42 [2021-10-29 05:20:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:01,933 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2021-10-29 05:20:01,934 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-10-29 05:20:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2021-10-29 05:20:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-29 05:20:01,934 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:01,935 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-10-29 05:20:01,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-29 05:20:01,935 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-10-29 05:20:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2034988657, now seen corresponding path program 1 times [2021-10-29 05:20:01,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:01,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70305460] [2021-10-29 05:20:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:01,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:02,013 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:02,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70305460] [2021-10-29 05:20:02,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70305460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:02,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:02,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:20:02,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981236635] [2021-10-29 05:20:02,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:20:02,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:20:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:02,017 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-10-29 05:20:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:02,200 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2021-10-29 05:20:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:20:02,201 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-10-29 05:20:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:02,202 INFO L225 Difference]: With dead ends: 174 [2021-10-29 05:20:02,202 INFO L226 Difference]: Without dead ends: 166 [2021-10-29 05:20:02,203 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-10-29 05:20:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-29 05:20:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2021-10-29 05:20:02,231 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-10-29 05:20:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-10-29 05:20:02,232 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 51 [2021-10-29 05:20:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:02,233 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-10-29 05:20:02,233 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-10-29 05:20:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-10-29 05:20:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-29 05:20:02,234 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:02,234 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-10-29 05:20:02,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-29 05:20:02,236 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-10-29 05:20:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1752254948, now seen corresponding path program 1 times [2021-10-29 05:20:02,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:02,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260713402] [2021-10-29 05:20:02,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:02,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:02,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:02,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260713402] [2021-10-29 05:20:02,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260713402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:02,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:02,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:20:02,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093908272] [2021-10-29 05:20:02,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:20:02,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:02,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:20:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:02,344 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-10-29 05:20:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:02,553 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2021-10-29 05:20:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:20:02,553 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-10-29 05:20:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:02,555 INFO L225 Difference]: With dead ends: 166 [2021-10-29 05:20:02,555 INFO L226 Difference]: Without dead ends: 160 [2021-10-29 05:20:02,556 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-10-29 05:20:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-29 05:20:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 108. [2021-10-29 05:20:02,584 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-10-29 05:20:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2021-10-29 05:20:02,585 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 63 [2021-10-29 05:20:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:02,585 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2021-10-29 05:20:02,586 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-10-29 05:20:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2021-10-29 05:20:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-29 05:20:02,590 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:02,590 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-10-29 05:20:02,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-29 05:20:02,591 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-10-29 05:20:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1700554364, now seen corresponding path program 1 times [2021-10-29 05:20:02,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:02,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653125439] [2021-10-29 05:20:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:02,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:02,716 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:02,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653125439] [2021-10-29 05:20:02,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653125439] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:02,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:02,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:20:02,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707873362] [2021-10-29 05:20:02,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:20:02,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:20:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:02,719 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-10-29 05:20:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:02,897 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2021-10-29 05:20:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:20:02,898 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-10-29 05:20:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:02,900 INFO L225 Difference]: With dead ends: 154 [2021-10-29 05:20:02,900 INFO L226 Difference]: Without dead ends: 148 [2021-10-29 05:20:02,901 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-10-29 05:20:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-10-29 05:20:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 99. [2021-10-29 05:20:02,931 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-10-29 05:20:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-10-29 05:20:02,932 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 64 [2021-10-29 05:20:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:02,932 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-10-29 05:20:02,932 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-10-29 05:20:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-10-29 05:20:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-29 05:20:02,938 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:20:02,938 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-10-29 05:20:02,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-29 05:20:02,939 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-10-29 05:20:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:20:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash -385312029, now seen corresponding path program 1 times [2021-10-29 05:20:02,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:20:02,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892615527] [2021-10-29 05:20:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:20:02,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:20:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:20:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:20:03,026 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:20:03,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892615527] [2021-10-29 05:20:03,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892615527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:20:03,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:20:03,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:20:03,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867102383] [2021-10-29 05:20:03,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:20:03,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:20:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:20:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:20:03,028 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-10-29 05:20:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:20:03,242 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2021-10-29 05:20:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:20:03,242 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-10-29 05:20:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:20:03,243 INFO L225 Difference]: With dead ends: 134 [2021-10-29 05:20:03,243 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 05:20:03,244 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-10-29 05:20:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 05:20:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 05:20:03,245 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-10-29 05:20:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 05:20:03,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-10-29 05:20:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:20:03,246 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 05:20:03,246 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-10-29 05:20:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 05:20:03,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 05:20:03,249 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,255 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,256 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,256 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,256 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,259 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,259 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,259 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,260 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,260 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,260 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,261 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,261 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,261 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,262 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,262 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,262 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,263 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,263 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,265 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,265 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,266 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,266 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,266 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,267 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,267 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,267 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,268 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,268 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,268 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,269 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,269 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,269 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,270 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,270 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,270 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,271 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,271 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,271 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,272 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,272 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,272 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,273 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:20:03,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-29 05:20:03,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 05:20:03,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:03,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:04,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:05,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:06,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:20:20,994 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-10-29 05:20:20,995 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-10-29 05:20:20,995 INFO L857 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2021-10-29 05:20:20,995 INFO L857 garLoopResultBuilder]: For program point L1031-2(lines 1026 1036) no Hoare annotation was computed. [2021-10-29 05:20:20,995 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-10-29 05:20:20,996 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:20,996 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:20,996 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:20,996 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:20,996 INFO L857 garLoopResultBuilder]: For program point L774(lines 774 778) no Hoare annotation was computed. [2021-10-29 05:20:20,997 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:20,997 INFO L857 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-10-29 05:20:20,997 INFO L857 garLoopResultBuilder]: For program point L511(lines 511 513) no Hoare annotation was computed. [2021-10-29 05:20:20,997 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-10-29 05:20:20,998 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-10-29 05:20:20,998 INFO L857 garLoopResultBuilder]: For program point L782(lines 782 786) no Hoare annotation was computed. [2021-10-29 05:20:20,999 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:20,999 INFO L857 garLoopResultBuilder]: For program point L519(lines 519 524) no Hoare annotation was computed. [2021-10-29 05:20:20,999 INFO L857 garLoopResultBuilder]: For program point L519-2(lines 501 631) no Hoare annotation was computed. [2021-10-29 05:20:20,999 INFO L857 garLoopResultBuilder]: For program point L387(lines 387 432) no Hoare annotation was computed. [2021-10-29 05:20:20,999 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 418) no Hoare annotation was computed. [2021-10-29 05:20:20,999 INFO L857 garLoopResultBuilder]: For program point L388-2(lines 388 418) no Hoare annotation was computed. [2021-10-29 05:20:21,000 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,000 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,000 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 270) no Hoare annotation was computed. [2021-10-29 05:20:21,000 INFO L857 garLoopResultBuilder]: For program point L257-1(lines 257 270) no Hoare annotation was computed. [2021-10-29 05:20:21,001 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,001 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-10-29 05:20:21,001 INFO L860 garLoopResultBuilder]: At program point L789(lines 773 830) the Hoare annotation is: true [2021-10-29 05:20:21,002 INFO L857 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2021-10-29 05:20:21,002 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-10-29 05:20:21,002 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-10-29 05:20:21,003 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-10-29 05:20:21,003 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-10-29 05:20:21,004 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-10-29 05:20:21,004 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-10-29 05:20:21,004 INFO L857 garLoopResultBuilder]: For program point L790(lines 790 827) no Hoare annotation was computed. [2021-10-29 05:20:21,005 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-10-29 05:20:21,005 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-10-29 05:20:21,005 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-10-29 05:20:21,005 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-10-29 05:20:21,006 INFO L857 garLoopResultBuilder]: For program point L526(lines 501 631) no Hoare annotation was computed. [2021-10-29 05:20:21,006 INFO L857 garLoopResultBuilder]: For program point L262(lines 262 269) no Hoare annotation was computed. [2021-10-29 05:20:21,006 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-10-29 05:20:21,006 INFO L857 garLoopResultBuilder]: For program point L262-2(lines 262 269) no Hoare annotation was computed. [2021-10-29 05:20:21,007 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-10-29 05:20:21,007 INFO L857 garLoopResultBuilder]: For program point L791(lines 791 826) no Hoare annotation was computed. [2021-10-29 05:20:21,007 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,007 INFO L857 garLoopResultBuilder]: For program point L792(lines 792 802) no Hoare annotation was computed. [2021-10-29 05:20:21,008 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-10-29 05:20:21,008 INFO L857 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2021-10-29 05:20:21,008 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-10-29 05:20:21,009 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,009 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,009 INFO L857 garLoopResultBuilder]: For program point L930(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,009 INFO L857 garLoopResultBuilder]: For program point L930-1(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,009 INFO L857 garLoopResultBuilder]: For program point L930-2(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,010 INFO L857 garLoopResultBuilder]: For program point L930-3(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,010 INFO L857 garLoopResultBuilder]: For program point L930-4(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,010 INFO L857 garLoopResultBuilder]: For program point L930-5(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,010 INFO L857 garLoopResultBuilder]: For program point L930-6(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,010 INFO L857 garLoopResultBuilder]: For program point L930-7(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,011 INFO L857 garLoopResultBuilder]: For program point L930-8(lines 930 947) no Hoare annotation was computed. [2021-10-29 05:20:21,011 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,011 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,011 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-10-29 05:20:21,011 INFO L857 garLoopResultBuilder]: For program point L405(lines 404 411) no Hoare annotation was computed. [2021-10-29 05:20:21,012 INFO L857 garLoopResultBuilder]: For program point L538(lines 538 540) no Hoare annotation was computed. [2021-10-29 05:20:21,012 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-10-29 05:20:21,012 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-10-29 05:20:21,013 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,013 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,013 INFO L857 garLoopResultBuilder]: For program point L806(lines 806 810) no Hoare annotation was computed. [2021-10-29 05:20:21,013 INFO L857 garLoopResultBuilder]: For program point L939(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,013 INFO L857 garLoopResultBuilder]: For program point L939-2(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,014 INFO L857 garLoopResultBuilder]: For program point L939-4(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,014 INFO L857 garLoopResultBuilder]: For program point L939-6(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,014 INFO L857 garLoopResultBuilder]: For program point L939-8(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,014 INFO L857 garLoopResultBuilder]: For program point L939-10(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,014 INFO L857 garLoopResultBuilder]: For program point L939-12(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,014 INFO L857 garLoopResultBuilder]: For program point L939-14(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,015 INFO L857 garLoopResultBuilder]: For program point L939-16(lines 939 946) no Hoare annotation was computed. [2021-10-29 05:20:21,015 INFO L857 garLoopResultBuilder]: For program point L279(lines 279 284) no Hoare annotation was computed. [2021-10-29 05:20:21,015 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-10-29 05:20:21,016 INFO L857 garLoopResultBuilder]: For program point L279-3(lines 279 284) no Hoare annotation was computed. [2021-10-29 05:20:21,016 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-10-29 05:20:21,016 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-10-29 05:20:21,016 INFO L857 garLoopResultBuilder]: For program point L546(lines 546 551) no Hoare annotation was computed. [2021-10-29 05:20:21,017 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,017 INFO L857 garLoopResultBuilder]: For program point L546-2(lines 546 551) no Hoare annotation was computed. [2021-10-29 05:20:21,017 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,017 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,018 INFO L857 garLoopResultBuilder]: For program point L1076(lines 1076 1096) no Hoare annotation was computed. [2021-10-29 05:20:21,018 INFO L857 garLoopResultBuilder]: For program point L812(lines 812 824) no Hoare annotation was computed. [2021-10-29 05:20:21,018 INFO L857 garLoopResultBuilder]: For program point L813(lines 813 817) no Hoare annotation was computed. [2021-10-29 05:20:21,018 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-10-29 05:20:21,019 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,019 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,019 INFO L857 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2021-10-29 05:20:21,019 INFO L857 garLoopResultBuilder]: For program point L555(lines 555 582) no Hoare annotation was computed. [2021-10-29 05:20:21,020 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-10-29 05:20:21,020 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-10-29 05:20:21,020 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,021 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,021 INFO L857 garLoopResultBuilder]: For program point L1088(lines 1088 1095) no Hoare annotation was computed. [2021-10-29 05:20:21,021 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:20:21,021 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:20:21,021 INFO L857 garLoopResultBuilder]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:20:21,021 INFO L857 garLoopResultBuilder]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:20:21,022 INFO L857 garLoopResultBuilder]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-10-29 05:20:21,022 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-10-29 05:20:21,022 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,022 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,023 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,023 INFO L860 garLoopResultBuilder]: At program point L831(lines 647 833) the Hoare annotation is: true [2021-10-29 05:20:21,023 INFO L857 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2021-10-29 05:20:21,023 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,023 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,024 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-10-29 05:20:21,024 INFO L857 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2021-10-29 05:20:21,024 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,024 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,024 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,025 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-10-29 05:20:21,025 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,025 INFO L857 garLoopResultBuilder]: For program point L318(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,025 INFO L857 garLoopResultBuilder]: For program point L318-1(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,025 INFO L857 garLoopResultBuilder]: For program point L318-2(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,026 INFO L857 garLoopResultBuilder]: For program point L318-3(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,026 INFO L857 garLoopResultBuilder]: For program point L318-4(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,026 INFO L857 garLoopResultBuilder]: For program point L318-5(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,026 INFO L857 garLoopResultBuilder]: For program point L318-6(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,026 INFO L857 garLoopResultBuilder]: For program point L318-7(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,027 INFO L857 garLoopResultBuilder]: For program point L318-8(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,027 INFO L857 garLoopResultBuilder]: For program point L318-9(lines 318 320) no Hoare annotation was computed. [2021-10-29 05:20:21,027 INFO L857 garLoopResultBuilder]: For program point L979(lines 979 998) no Hoare annotation was computed. [2021-10-29 05:20:21,027 INFO L857 garLoopResultBuilder]: For program point L979-1(lines 979 998) no Hoare annotation was computed. [2021-10-29 05:20:21,027 INFO L857 garLoopResultBuilder]: For program point L979-2(lines 979 998) no Hoare annotation was computed. [2021-10-29 05:20:21,027 INFO L857 garLoopResultBuilder]: For program point L979-3(lines 979 998) no Hoare annotation was computed. [2021-10-29 05:20:21,028 INFO L857 garLoopResultBuilder]: For program point L979-4(lines 979 998) no Hoare annotation was computed. [2021-10-29 05:20:21,028 INFO L857 garLoopResultBuilder]: For program point L979-5(lines 979 998) no Hoare annotation was computed. [2021-10-29 05:20:21,028 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,028 INFO L857 garLoopResultBuilder]: For program point L980(lines 980 985) no Hoare annotation was computed. [2021-10-29 05:20:21,028 INFO L857 garLoopResultBuilder]: For program point L980-2(lines 980 985) no Hoare annotation was computed. [2021-10-29 05:20:21,029 INFO L857 garLoopResultBuilder]: For program point L980-4(lines 980 985) no Hoare annotation was computed. [2021-10-29 05:20:21,029 INFO L857 garLoopResultBuilder]: For program point L980-6(lines 980 985) no Hoare annotation was computed. [2021-10-29 05:20:21,029 INFO L857 garLoopResultBuilder]: For program point L980-8(lines 980 985) no Hoare annotation was computed. [2021-10-29 05:20:21,029 INFO L857 garLoopResultBuilder]: For program point L980-10(lines 980 985) no Hoare annotation was computed. [2021-10-29 05:20:21,029 INFO L857 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,029 INFO L857 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,030 INFO L857 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,030 INFO L857 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,030 INFO L857 garLoopResultBuilder]: For program point L56-4(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,030 INFO L857 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,030 INFO L857 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,031 INFO L857 garLoopResultBuilder]: For program point L56-7(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,031 INFO L857 garLoopResultBuilder]: For program point L56-8(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,031 INFO L857 garLoopResultBuilder]: For program point L56-9(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,031 INFO L857 garLoopResultBuilder]: For program point L56-10(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,031 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-10-29 05:20:21,032 INFO L857 garLoopResultBuilder]: For program point L56-11(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,032 INFO L857 garLoopResultBuilder]: For program point L56-12(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,032 INFO L857 garLoopResultBuilder]: For program point L56-13(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,032 INFO L857 garLoopResultBuilder]: For program point L56-14(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,032 INFO L857 garLoopResultBuilder]: For program point L56-15(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,033 INFO L857 garLoopResultBuilder]: For program point L56-16(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,033 INFO L857 garLoopResultBuilder]: For program point L56-17(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,033 INFO L857 garLoopResultBuilder]: For program point L56-18(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,033 INFO L857 garLoopResultBuilder]: For program point L56-19(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,033 INFO L857 garLoopResultBuilder]: For program point L56-20(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,033 INFO L857 garLoopResultBuilder]: For program point L56-21(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,034 INFO L857 garLoopResultBuilder]: For program point L56-22(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,034 INFO L857 garLoopResultBuilder]: For program point L56-23(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,034 INFO L857 garLoopResultBuilder]: For program point L56-24(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,034 INFO L857 garLoopResultBuilder]: For program point L56-25(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,034 INFO L857 garLoopResultBuilder]: For program point L56-26(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,035 INFO L857 garLoopResultBuilder]: For program point L56-27(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,035 INFO L857 garLoopResultBuilder]: For program point L56-28(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,035 INFO L857 garLoopResultBuilder]: For program point L56-29(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,035 INFO L857 garLoopResultBuilder]: For program point L56-30(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,035 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-10-29 05:20:21,036 INFO L857 garLoopResultBuilder]: For program point L56-31(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,036 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-10-29 05:20:21,036 INFO L857 garLoopResultBuilder]: For program point L56-32(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,036 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-10-29 05:20:21,036 INFO L857 garLoopResultBuilder]: For program point L56-33(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,037 INFO L857 garLoopResultBuilder]: For program point L56-34(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,037 INFO L857 garLoopResultBuilder]: For program point L56-35(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,037 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-10-29 05:20:21,037 INFO L857 garLoopResultBuilder]: For program point L56-36(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,037 INFO L857 garLoopResultBuilder]: For program point L56-37(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,038 INFO L857 garLoopResultBuilder]: For program point L56-38(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,038 INFO L857 garLoopResultBuilder]: For program point L56-39(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,038 INFO L857 garLoopResultBuilder]: For program point L56-40(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,038 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-10-29 05:20:21,039 INFO L857 garLoopResultBuilder]: For program point L56-41(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,039 INFO L857 garLoopResultBuilder]: For program point L56-42(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,039 INFO L857 garLoopResultBuilder]: For program point L56-43(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,039 INFO L857 garLoopResultBuilder]: For program point L56-44(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,040 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-10-29 05:20:21,040 INFO L857 garLoopResultBuilder]: For program point L56-45(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,040 INFO L857 garLoopResultBuilder]: For program point L56-46(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,040 INFO L857 garLoopResultBuilder]: For program point L56-47(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,040 INFO L857 garLoopResultBuilder]: For program point L56-48(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,041 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-10-29 05:20:21,041 INFO L857 garLoopResultBuilder]: For program point L56-49(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,041 INFO L857 garLoopResultBuilder]: For program point L56-50(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,042 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-10-29 05:20:21,042 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 05:20:21,042 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-10-29 05:20:21,043 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-10-29 05:20:21,043 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-10-29 05:20:21,043 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-10-29 05:20:21,044 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-10-29 05:20:21,044 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-10-29 05:20:21,044 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-10-29 05:20:21,044 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-10-29 05:20:21,045 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-10-29 05:20:21,045 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,045 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,045 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-10-29 05:20:21,046 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,046 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-10-29 05:20:21,046 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-10-29 05:20:21,047 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-10-29 05:20:21,047 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-10-29 05:20:21,047 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-10-29 05:20:21,048 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-10-29 05:20:21,048 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 202) no Hoare annotation was computed. [2021-10-29 05:20:21,048 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-10-29 05:20:21,049 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,049 INFO L857 garLoopResultBuilder]: For program point L992(lines 992 996) no Hoare annotation was computed. [2021-10-29 05:20:21,049 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-10-29 05:20:21,049 INFO L857 garLoopResultBuilder]: For program point L992-2(lines 992 996) no Hoare annotation was computed. [2021-10-29 05:20:21,050 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-10-29 05:20:21,050 INFO L857 garLoopResultBuilder]: For program point L992-4(lines 992 996) no Hoare annotation was computed. [2021-10-29 05:20:21,050 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-10-29 05:20:21,050 INFO L857 garLoopResultBuilder]: For program point L992-6(lines 992 996) no Hoare annotation was computed. [2021-10-29 05:20:21,051 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-10-29 05:20:21,051 INFO L857 garLoopResultBuilder]: For program point L992-8(lines 992 996) no Hoare annotation was computed. [2021-10-29 05:20:21,051 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-10-29 05:20:21,052 INFO L857 garLoopResultBuilder]: For program point L992-10(lines 992 996) no Hoare annotation was computed. [2021-10-29 05:20:21,052 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-10-29 05:20:21,052 INFO L857 garLoopResultBuilder]: For program point L597(lines 597 599) no Hoare annotation was computed. [2021-10-29 05:20:21,052 INFO L857 garLoopResultBuilder]: For program point L863(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,053 INFO L857 garLoopResultBuilder]: For program point L863-2(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,053 INFO L857 garLoopResultBuilder]: For program point L863-4(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,053 INFO L857 garLoopResultBuilder]: For program point L863-6(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,053 INFO L857 garLoopResultBuilder]: For program point L863-8(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,053 INFO L857 garLoopResultBuilder]: For program point L863-10(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,054 INFO L857 garLoopResultBuilder]: For program point L863-12(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,054 INFO L857 garLoopResultBuilder]: For program point L863-14(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,054 INFO L857 garLoopResultBuilder]: For program point L863-16(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,054 INFO L857 garLoopResultBuilder]: For program point L863-18(lines 863 869) no Hoare annotation was computed. [2021-10-29 05:20:21,054 INFO L857 garLoopResultBuilder]: For program point L336-1(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,055 INFO L857 garLoopResultBuilder]: For program point L336-3(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,055 INFO L857 garLoopResultBuilder]: For program point L336-5(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,055 INFO L857 garLoopResultBuilder]: For program point L336-7(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,055 INFO L857 garLoopResultBuilder]: For program point L336-9(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,055 INFO L857 garLoopResultBuilder]: For program point L336-11(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,056 INFO L857 garLoopResultBuilder]: For program point L336-13(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,056 INFO L857 garLoopResultBuilder]: For program point L336-15(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,056 INFO L857 garLoopResultBuilder]: For program point L336-17(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,056 INFO L857 garLoopResultBuilder]: For program point L336-19(lines 317 352) no Hoare annotation was computed. [2021-10-29 05:20:21,056 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,057 INFO L857 garLoopResultBuilder]: For program point L605(lines 605 610) no Hoare annotation was computed. [2021-10-29 05:20:21,058 INFO L857 garLoopResultBuilder]: For program point L605-2(lines 526 624) no Hoare annotation was computed. [2021-10-29 05:20:21,058 INFO L853 garLoopResultBuilder]: At program point L341(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,058 INFO L853 garLoopResultBuilder]: At program point L341-1(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,058 INFO L853 garLoopResultBuilder]: At program point L341-2(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,058 INFO L853 garLoopResultBuilder]: At program point L341-3(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,059 INFO L853 garLoopResultBuilder]: At program point L341-4(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,059 INFO L853 garLoopResultBuilder]: At program point L341-5(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,059 INFO L853 garLoopResultBuilder]: At program point L341-6(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,059 INFO L853 garLoopResultBuilder]: At program point L341-7(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,059 INFO L853 garLoopResultBuilder]: At program point L341-8(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,060 INFO L853 garLoopResultBuilder]: At program point L341-9(lines 341 350) the Hoare annotation is: false [2021-10-29 05:20:21,060 INFO L857 garLoopResultBuilder]: For program point L342(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,060 INFO L857 garLoopResultBuilder]: For program point L342-2(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,060 INFO L857 garLoopResultBuilder]: For program point L342-4(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,060 INFO L857 garLoopResultBuilder]: For program point L342-6(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,060 INFO L857 garLoopResultBuilder]: For program point L342-8(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,061 INFO L857 garLoopResultBuilder]: For program point L342-10(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,061 INFO L857 garLoopResultBuilder]: For program point L342-12(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,061 INFO L857 garLoopResultBuilder]: For program point L342-14(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,061 INFO L857 garLoopResultBuilder]: For program point L342-16(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,061 INFO L857 garLoopResultBuilder]: For program point L342-18(lines 342 348) no Hoare annotation was computed. [2021-10-29 05:20:21,062 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-10-29 05:20:21,062 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,062 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,062 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-29 05:20:21,063 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,063 INFO L853 garLoopResultBuilder]: At program point L351(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,063 INFO L853 garLoopResultBuilder]: At program point L351-1(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,063 INFO L853 garLoopResultBuilder]: At program point L351-2(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,063 INFO L853 garLoopResultBuilder]: At program point L351-3(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,064 INFO L853 garLoopResultBuilder]: At program point L351-4(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,064 INFO L853 garLoopResultBuilder]: At program point L351-5(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,064 INFO L853 garLoopResultBuilder]: At program point L351-6(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,064 INFO L853 garLoopResultBuilder]: At program point L351-7(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,064 INFO L853 garLoopResultBuilder]: At program point L351-8(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,065 INFO L853 garLoopResultBuilder]: At program point L351-9(lines 300 353) the Hoare annotation is: false [2021-10-29 05:20:21,065 INFO L857 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2021-10-29 05:20:21,065 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,065 INFO L857 garLoopResultBuilder]: For program point L881(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,065 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,066 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-10-29 05:20:21,066 INFO L857 garLoopResultBuilder]: For program point L881-2(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,066 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-10-29 05:20:21,066 INFO L857 garLoopResultBuilder]: For program point L881-4(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,067 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-10-29 05:20:21,067 INFO L857 garLoopResultBuilder]: For program point L881-6(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,067 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-10-29 05:20:21,067 INFO L857 garLoopResultBuilder]: For program point L881-8(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,068 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-10-29 05:20:21,068 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-10-29 05:20:21,068 INFO L857 garLoopResultBuilder]: For program point L881-10(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,069 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-10-29 05:20:21,069 INFO L857 garLoopResultBuilder]: For program point L881-12(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,069 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-10-29 05:20:21,069 INFO L857 garLoopResultBuilder]: For program point L881-14(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,069 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-10-29 05:20:21,070 INFO L857 garLoopResultBuilder]: For program point L881-16(lines 881 899) no Hoare annotation was computed. [2021-10-29 05:20:21,070 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-10-29 05:20:21,070 INFO L857 garLoopResultBuilder]: For program point L221(lines 221 227) no Hoare annotation was computed. [2021-10-29 05:20:21,070 INFO L853 garLoopResultBuilder]: At program point L882(lines 882 890) the Hoare annotation is: false [2021-10-29 05:20:21,071 INFO L857 garLoopResultBuilder]: For program point L882-2(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,071 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-10-29 05:20:21,071 INFO L857 garLoopResultBuilder]: For program point L882-5(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,071 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-10-29 05:20:21,071 INFO L857 garLoopResultBuilder]: For program point L882-8(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,072 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-10-29 05:20:21,072 INFO L857 garLoopResultBuilder]: For program point L882-11(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,072 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-10-29 05:20:21,072 INFO L857 garLoopResultBuilder]: For program point L882-14(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,073 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-10-29 05:20:21,073 INFO L857 garLoopResultBuilder]: For program point L882-17(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,073 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-10-29 05:20:21,073 INFO L857 garLoopResultBuilder]: For program point L882-20(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,074 INFO L853 garLoopResultBuilder]: At program point L882-21(lines 882 890) the Hoare annotation is: false [2021-10-29 05:20:21,074 INFO L857 garLoopResultBuilder]: For program point L882-23(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,074 INFO L853 garLoopResultBuilder]: At program point L882-24(lines 882 890) the Hoare annotation is: false [2021-10-29 05:20:21,074 INFO L857 garLoopResultBuilder]: For program point L882-26(lines 882 890) no Hoare annotation was computed. [2021-10-29 05:20:21,074 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,074 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,075 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-10-29 05:20:21,075 INFO L857 garLoopResultBuilder]: For program point L1025(lines 1025 1045) no Hoare annotation was computed. [2021-10-29 05:20:21,075 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-10-29 05:20:21,076 INFO L857 garLoopResultBuilder]: For program point L893(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,076 INFO L857 garLoopResultBuilder]: For program point L893-2(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,076 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,076 INFO L857 garLoopResultBuilder]: For program point L893-4(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,076 INFO L857 garLoopResultBuilder]: For program point L893-6(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,077 INFO L857 garLoopResultBuilder]: For program point L893-8(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,077 INFO L857 garLoopResultBuilder]: For program point L893-10(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,077 INFO L857 garLoopResultBuilder]: For program point L893-12(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,077 INFO L857 garLoopResultBuilder]: For program point L893-14(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,077 INFO L857 garLoopResultBuilder]: For program point L893-16(lines 893 897) no Hoare annotation was computed. [2021-10-29 05:20:21,078 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-29 05:20:21,078 INFO L853 garLoopResultBuilder]: At program point L1026(lines 1026 1036) the Hoare annotation is: false [2021-10-29 05:20:21,082 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-10-29 05:20:21,084 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:20:21,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:20:21 BoogieIcfgContainer [2021-10-29 05:20:21,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:20:21,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:20:21,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:20:21,220 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:20:21,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:19:48" (3/4) ... [2021-10-29 05:20:21,225 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 05:20:21,284 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 267 nodes and edges [2021-10-29 05:20:21,291 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2021-10-29 05:20:21,298 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-10-29 05:20:21,306 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-29 05:20:21,345 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-10-29 05:20:21,345 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-10-29 05:20:21,346 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-10-29 05:20:21,347 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-10-29 05:20:21,350 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-10-29 05:20:21,364 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-10-29 05:20:21,366 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-10-29 05:20:21,660 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:20:21,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:20:21,663 INFO L168 Benchmark]: Toolchain (without parser) took 37757.07 ms. Allocated memory was 104.9 MB in the beginning and 406.8 MB in the end (delta: 302.0 MB). Free memory was 81.8 MB in the beginning and 183.3 MB in the end (delta: -101.5 MB). Peak memory consumption was 197.9 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,663 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 104.9 MB. Free memory is still 63.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:20:21,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.59 ms. Allocated memory was 104.9 MB in the beginning and 142.6 MB in the end (delta: 37.7 MB). Free memory was 81.5 MB in the beginning and 108.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.89 ms. Allocated memory is still 142.6 MB. Free memory was 108.7 MB in the beginning and 97.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,665 INFO L168 Benchmark]: Boogie Preprocessor took 209.05 ms. Allocated memory is still 142.6 MB. Free memory was 97.5 MB in the beginning and 90.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,666 INFO L168 Benchmark]: RCFGBuilder took 3664.49 ms. Allocated memory was 142.6 MB in the beginning and 192.9 MB in the end (delta: 50.3 MB). Free memory was 90.3 MB in the beginning and 111.6 MB in the end (delta: -21.3 MB). Peak memory consumption was 45.7 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,666 INFO L168 Benchmark]: TraceAbstraction took 32400.64 ms. Allocated memory was 192.9 MB in the beginning and 406.8 MB in the end (delta: 213.9 MB). Free memory was 111.6 MB in the beginning and 238.4 MB in the end (delta: -126.9 MB). Peak memory consumption was 208.8 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,667 INFO L168 Benchmark]: Witness Printer took 441.48 ms. Allocated memory is still 406.8 MB. Free memory was 238.4 MB in the beginning and 183.3 MB in the end (delta: 55.1 MB). Peak memory consumption was 54.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:20:21,670 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.32 ms. Allocated memory is still 104.9 MB. Free memory is still 63.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 835.59 ms. Allocated memory was 104.9 MB in the beginning and 142.6 MB in the end (delta: 37.7 MB). Free memory was 81.5 MB in the beginning and 108.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 196.89 ms. Allocated memory is still 142.6 MB. Free memory was 108.7 MB in the beginning and 97.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 209.05 ms. Allocated memory is still 142.6 MB. Free memory was 97.5 MB in the beginning and 90.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3664.49 ms. Allocated memory was 142.6 MB in the beginning and 192.9 MB in the end (delta: 50.3 MB). Free memory was 90.3 MB in the beginning and 111.6 MB in the end (delta: -21.3 MB). Peak memory consumption was 45.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32400.64 ms. Allocated memory was 192.9 MB in the beginning and 406.8 MB in the end (delta: 213.9 MB). Free memory was 111.6 MB in the beginning and 238.4 MB in the end (delta: -126.9 MB). Peak memory consumption was 208.8 MB. Max. memory is 16.1 GB. * Witness Printer took 441.48 ms. Allocated memory is still 406.8 MB. Free memory was 238.4 MB in the beginning and 183.3 MB in the end (delta: 55.1 MB). Peak memory consumption was 54.5 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: 32.1s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9823 SDtfs, 8520 SDslu, 11681 SDs, 0 SdLazy, 4154 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s 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.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 1392 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 109 PreInvPairs, 294 NumberOfFragments, 9492 HoareAnnotationTreeSize, 109 FomulaSimplifications, 7385055 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 109 FomulaSimplificationsInter, 198249 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s 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-10-29 05:20:21,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_316755d5-e8fc-4ebe-8d20-85211260bab8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...