./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE --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 b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 10:08:04,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:08:04,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:08:04,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:08:04,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:08:04,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:08:04,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:08:04,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:08:04,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:08:04,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:08:04,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:08:04,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:08:04,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:08:04,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:08:04,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:08:04,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:08:04,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:08:04,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:08:04,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:08:04,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:08:04,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:08:04,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:08:04,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:08:04,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:08:04,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:08:04,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:08:04,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:08:04,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:08:04,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:08:04,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:08:04,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:08:04,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:08:04,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:08:04,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:08:04,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:08:04,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:08:04,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:08:04,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:08:04,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:08:04,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:08:04,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:08:04,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 10:08:04,922 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:08:04,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:08:04,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:08:04,926 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:08:04,926 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:08:04,927 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:08:04,927 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 10:08:04,927 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:08:04,933 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:08:04,934 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 10:08:04,935 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 10:08:04,935 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:08:04,935 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 10:08:04,935 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 10:08:04,936 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 10:08:04,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:08:04,936 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:08:04,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:08:04,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:08:04,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:08:04,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 10:08:04,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:08:04,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 10:08:04,938 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:08:04,938 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:08:04,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 10:08:04,938 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:08:04,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 10:08:04,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:08:04,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:08:04,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:08:04,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:08:04,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:08:04,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 10:08:04,940 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 10:08:04,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 10:08:04,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 10:08:04,941 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:08:04,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:08:04,941 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_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/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_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE 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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-10-24 10:08:05,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:08:05,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:08:05,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:08:05,225 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:08:05,225 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:08:05,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-24 10:08:05,298 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/data/d3bb9f527/ea39a786a5254d419c6da521d92a3837/FLAGac9555faf [2021-10-24 10:08:05,815 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:08:05,816 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-24 10:08:05,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/data/d3bb9f527/ea39a786a5254d419c6da521d92a3837/FLAGac9555faf [2021-10-24 10:08:06,107 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/data/d3bb9f527/ea39a786a5254d419c6da521d92a3837 [2021-10-24 10:08:06,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:08:06,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:08:06,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:08:06,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:08:06,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:08:06,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64903e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06, skipping insertion in model container [2021-10-24 10:08:06,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:08:06,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:08:06,598 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_04f2f349-7c7f-410e-8ce8-f36f65042f09/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-24 10:08:06,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:08:06,615 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:08:06,766 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_04f2f349-7c7f-410e-8ce8-f36f65042f09/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-24 10:08:06,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:08:06,789 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:08:06,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06 WrapperNode [2021-10-24 10:08:06,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:08:06,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:08:06,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:08:06,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:08:06,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:08:06,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:08:06,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:08:06,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:08:06,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:06,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:07,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:07,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:07,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:08:07,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:08:07,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:08:07,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:08:07,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (1/1) ... [2021-10-24 10:08:07,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:08:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:08:07,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:08:07,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:08:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:08:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 10:08:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:08:07,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:08:07,447 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,482 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,486 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,492 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,493 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,494 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,498 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,504 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,507 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,513 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,520 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,522 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,527 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,530 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,534 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,536 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,540 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,543 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,545 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,546 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,547 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,551 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,555 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,559 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,560 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,563 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,566 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,567 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,567 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:07,570 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-24 10:08:08,714 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-10-24 10:08:08,714 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-10-24 10:08:08,714 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-10-24 10:08:08,715 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-10-24 10:08:08,715 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-10-24 10:08:08,715 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-10-24 10:08:08,715 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-24 10:08:08,715 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-24 10:08:08,715 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-10-24 10:08:08,716 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-10-24 10:08:08,716 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-24 10:08:08,716 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-24 10:08:08,716 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-24 10:08:08,716 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-24 10:08:08,717 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-10-24 10:08:08,717 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-10-24 10:08:08,718 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-10-24 10:08:08,718 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-10-24 10:08:08,718 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-24 10:08:08,719 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-24 10:08:08,719 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-10-24 10:08:08,719 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-24 10:08:08,720 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-24 10:08:08,720 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-10-24 10:08:08,720 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-10-24 10:08:08,720 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-10-24 10:08:08,721 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-10-24 10:08:08,721 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-10-24 10:08:08,721 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-10-24 10:08:08,721 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-10-24 10:08:08,721 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-10-24 10:08:08,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-10-24 10:08:08,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-10-24 10:08:08,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-10-24 10:08:08,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-10-24 10:08:08,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-10-24 10:08:08,723 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-24 10:08:08,723 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-24 10:08:08,723 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-10-24 10:08:08,724 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-10-24 10:08:08,724 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-10-24 10:08:08,725 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-10-24 10:08:08,725 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-10-24 10:08:08,725 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-10-24 10:08:08,725 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-10-24 10:08:08,725 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-10-24 10:08:08,725 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-10-24 10:08:08,726 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-10-24 10:08:08,726 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-10-24 10:08:08,726 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-10-24 10:08:08,726 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-24 10:08:08,728 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-24 10:08:08,728 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-10-24 10:08:08,729 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-10-24 10:08:08,729 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-10-24 10:08:08,729 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-10-24 10:08:08,729 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-10-24 10:08:08,730 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-10-24 10:08:08,730 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-10-24 10:08:08,731 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-10-24 10:08:09,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:08:09,849 INFO L299 CfgBuilder]: Removed 275 assume(true) statements. [2021-10-24 10:08:09,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:08:09 BoogieIcfgContainer [2021-10-24 10:08:09,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:08:09,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:08:09,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:08:09,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:08:09,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:08:06" (1/3) ... [2021-10-24 10:08:09,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76250a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:08:09, skipping insertion in model container [2021-10-24 10:08:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:08:06" (2/3) ... [2021-10-24 10:08:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76250a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:08:09, skipping insertion in model container [2021-10-24 10:08:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:08:09" (3/3) ... [2021-10-24 10:08:09,864 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-24 10:08:09,873 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:08:09,873 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2021-10-24 10:08:09,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:08:09,942 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-24 10:08:09,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2021-10-24 10:08:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 297 states have (on average 1.7744107744107744) internal successors, (527), 350 states have internal predecessors, (527), 0 states have call successors, (0), 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-24 10:08:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-24 10:08:09,979 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:09,979 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-24 10:08:09,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash 3916932, now seen corresponding path program 1 times [2021-10-24 10:08:09,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:09,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738505933] [2021-10-24 10:08:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:09,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:10,166 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-24 10:08:10,167 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:10,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738505933] [2021-10-24 10:08:10,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738505933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:10,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:10,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:10,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304869750] [2021-10-24 10:08:10,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:10,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:10,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,191 INFO L87 Difference]: Start difference. First operand has 351 states, 297 states have (on average 1.7744107744107744) internal successors, (527), 350 states have internal predecessors, (527), 0 states have call successors, (0), 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-24 10:08:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:10,516 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2021-10-24 10:08:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:10,518 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-24 10:08:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:10,543 INFO L225 Difference]: With dead ends: 637 [2021-10-24 10:08:10,543 INFO L226 Difference]: Without dead ends: 359 [2021-10-24 10:08:10,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-10-24 10:08:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2021-10-24 10:08:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 308 states have (on average 1.5064935064935066) internal successors, (464), 341 states have internal predecessors, (464), 0 states have call successors, (0), 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-24 10:08:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2021-10-24 10:08:10,605 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2021-10-24 10:08:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:10,606 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2021-10-24 10:08:10,606 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-24 10:08:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2021-10-24 10:08:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-24 10:08:10,607 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:10,607 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:08:10,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 10:08:10,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1581488811, now seen corresponding path program 1 times [2021-10-24 10:08:10,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:10,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576641564] [2021-10-24 10:08:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:10,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:10,654 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-24 10:08:10,654 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:10,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576641564] [2021-10-24 10:08:10,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576641564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:10,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:10,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:08:10,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955035075] [2021-10-24 10:08:10,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:10,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,658 INFO L87 Difference]: Start difference. First operand 342 states and 464 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-24 10:08:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:10,683 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2021-10-24 10:08:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:10,683 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-24 10:08:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:10,685 INFO L225 Difference]: With dead ends: 378 [2021-10-24 10:08:10,686 INFO L226 Difference]: Without dead ends: 358 [2021-10-24 10:08:10,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-24 10:08:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2021-10-24 10:08:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 319 states have (on average 1.5015673981191222) internal successors, (479), 352 states have internal predecessors, (479), 0 states have call successors, (0), 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-24 10:08:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 479 transitions. [2021-10-24 10:08:10,711 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 479 transitions. Word has length 10 [2021-10-24 10:08:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:10,712 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 479 transitions. [2021-10-24 10:08:10,712 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-24 10:08:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 479 transitions. [2021-10-24 10:08:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-24 10:08:10,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:10,713 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:08:10,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 10:08:10,714 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:10,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1365717038, now seen corresponding path program 1 times [2021-10-24 10:08:10,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:10,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419505334] [2021-10-24 10:08:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:10,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:10,799 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-24 10:08:10,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:10,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419505334] [2021-10-24 10:08:10,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419505334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:10,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:10,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:10,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54319142] [2021-10-24 10:08:10,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:10,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:10,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,802 INFO L87 Difference]: Start difference. First operand 353 states and 479 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-24 10:08:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:10,865 INFO L93 Difference]: Finished difference Result 431 states and 575 transitions. [2021-10-24 10:08:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:10,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-10-24 10:08:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:10,868 INFO L225 Difference]: With dead ends: 431 [2021-10-24 10:08:10,868 INFO L226 Difference]: Without dead ends: 397 [2021-10-24 10:08:10,869 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-24 10:08:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 373. [2021-10-24 10:08:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 342 states have (on average 1.4883040935672514) internal successors, (509), 372 states have internal predecessors, (509), 0 states have call successors, (0), 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-24 10:08:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 509 transitions. [2021-10-24 10:08:10,890 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 509 transitions. Word has length 11 [2021-10-24 10:08:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:10,890 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 509 transitions. [2021-10-24 10:08:10,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-24 10:08:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 509 transitions. [2021-10-24 10:08:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-24 10:08:10,892 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:10,892 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:08:10,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 10:08:10,893 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash -698114258, now seen corresponding path program 1 times [2021-10-24 10:08:10,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:10,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060884885] [2021-10-24 10:08:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:10,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:10,963 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-24 10:08:10,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:10,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060884885] [2021-10-24 10:08:10,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060884885] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:10,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:10,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:10,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159091403] [2021-10-24 10:08:10,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:10,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:10,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:10,966 INFO L87 Difference]: Start difference. First operand 373 states and 509 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-24 10:08:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:11,025 INFO L93 Difference]: Finished difference Result 611 states and 816 transitions. [2021-10-24 10:08:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-24 10:08:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:11,028 INFO L225 Difference]: With dead ends: 611 [2021-10-24 10:08:11,029 INFO L226 Difference]: Without dead ends: 435 [2021-10-24 10:08:11,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-24 10:08:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 351. [2021-10-24 10:08:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 330 states have (on average 1.4393939393939394) internal successors, (475), 350 states have internal predecessors, (475), 0 states have call successors, (0), 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-24 10:08:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2021-10-24 10:08:11,051 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 12 [2021-10-24 10:08:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:11,052 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2021-10-24 10:08:11,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-24 10:08:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2021-10-24 10:08:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-24 10:08:11,053 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:11,054 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:08:11,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 10:08:11,054 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:11,055 INFO L82 PathProgramCache]: Analyzing trace with hash 968473548, now seen corresponding path program 1 times [2021-10-24 10:08:11,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:11,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693109147] [2021-10-24 10:08:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:11,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:11,096 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-24 10:08:11,096 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:11,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693109147] [2021-10-24 10:08:11,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693109147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:11,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:11,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:11,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938660136] [2021-10-24 10:08:11,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:11,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:11,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:11,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:11,099 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-24 10:08:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:11,253 INFO L93 Difference]: Finished difference Result 375 states and 503 transitions. [2021-10-24 10:08:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:11,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-10-24 10:08:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:11,257 INFO L225 Difference]: With dead ends: 375 [2021-10-24 10:08:11,257 INFO L226 Difference]: Without dead ends: 357 [2021-10-24 10:08:11,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-24 10:08:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-24 10:08:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 336 states have (on average 1.4285714285714286) internal successors, (480), 356 states have internal predecessors, (480), 0 states have call successors, (0), 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-24 10:08:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2021-10-24 10:08:11,283 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 14 [2021-10-24 10:08:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:11,284 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2021-10-24 10:08:11,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-24 10:08:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2021-10-24 10:08:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-24 10:08:11,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:11,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:08:11,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 10:08:11,292 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1947817000, now seen corresponding path program 1 times [2021-10-24 10:08:11,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:11,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521663873] [2021-10-24 10:08:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:11,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:11,400 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-24 10:08:11,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:11,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521663873] [2021-10-24 10:08:11,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521663873] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:11,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:11,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:11,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615950258] [2021-10-24 10:08:11,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:11,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:11,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:11,408 INFO L87 Difference]: Start difference. First operand 357 states and 480 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-24 10:08:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:11,573 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2021-10-24 10:08:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:11,574 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-24 10:08:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:11,576 INFO L225 Difference]: With dead ends: 357 [2021-10-24 10:08:11,577 INFO L226 Difference]: Without dead ends: 341 [2021-10-24 10:08:11,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-24 10:08:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-10-24 10:08:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 328 states have (on average 1.4115853658536586) internal successors, (463), 340 states have internal predecessors, (463), 0 states have call successors, (0), 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-24 10:08:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2021-10-24 10:08:11,599 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2021-10-24 10:08:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:11,599 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2021-10-24 10:08:11,600 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-24 10:08:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2021-10-24 10:08:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-24 10:08:11,602 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:11,602 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:08:11,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 10:08:11,603 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash 670796967, now seen corresponding path program 1 times [2021-10-24 10:08:11,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:11,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837281388] [2021-10-24 10:08:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:11,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:11,693 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-24 10:08:11,693 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:11,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837281388] [2021-10-24 10:08:11,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837281388] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:11,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:11,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:08:11,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749893203] [2021-10-24 10:08:11,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:11,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:11,704 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-24 10:08:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:11,752 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2021-10-24 10:08:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:11,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-24 10:08:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:11,755 INFO L225 Difference]: With dead ends: 425 [2021-10-24 10:08:11,755 INFO L226 Difference]: Without dead ends: 389 [2021-10-24 10:08:11,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-10-24 10:08:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 328. [2021-10-24 10:08:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 315 states have (on average 1.4063492063492065) internal successors, (443), 327 states have internal predecessors, (443), 0 states have call successors, (0), 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-24 10:08:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 443 transitions. [2021-10-24 10:08:11,778 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 443 transitions. Word has length 19 [2021-10-24 10:08:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:11,778 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 443 transitions. [2021-10-24 10:08:11,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-24 10:08:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 443 transitions. [2021-10-24 10:08:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-24 10:08:11,780 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:11,780 INFO L512 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-24 10:08:11,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 10:08:11,781 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash 276863221, now seen corresponding path program 1 times [2021-10-24 10:08:11,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:11,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35325788] [2021-10-24 10:08:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:11,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:11,864 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-24 10:08:11,864 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:11,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35325788] [2021-10-24 10:08:11,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35325788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:11,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:11,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:11,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619047915] [2021-10-24 10:08:11,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:11,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:11,867 INFO L87 Difference]: Start difference. First operand 328 states and 443 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-24 10:08:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:11,997 INFO L93 Difference]: Finished difference Result 428 states and 576 transitions. [2021-10-24 10:08:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:11,997 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-24 10:08:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:12,000 INFO L225 Difference]: With dead ends: 428 [2021-10-24 10:08:12,001 INFO L226 Difference]: Without dead ends: 325 [2021-10-24 10:08:12,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-24 10:08:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-10-24 10:08:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.3980891719745223) internal successors, (439), 324 states have internal predecessors, (439), 0 states have call successors, (0), 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-24 10:08:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 439 transitions. [2021-10-24 10:08:12,029 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 439 transitions. Word has length 20 [2021-10-24 10:08:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:12,029 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 439 transitions. [2021-10-24 10:08:12,030 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-24 10:08:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 439 transitions. [2021-10-24 10:08:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-24 10:08:12,031 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:12,031 INFO L512 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-24 10:08:12,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 10:08:12,032 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1071552806, now seen corresponding path program 1 times [2021-10-24 10:08:12,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:12,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500115962] [2021-10-24 10:08:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:12,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:12,134 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-24 10:08:12,135 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:12,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500115962] [2021-10-24 10:08:12,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500115962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:12,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:12,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:12,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069234853] [2021-10-24 10:08:12,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:12,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:12,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:12,143 INFO L87 Difference]: Start difference. First operand 325 states and 439 transitions. Second operand has 4 states, 4 states have (on average 5.0) 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-24 10:08:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:12,301 INFO L93 Difference]: Finished difference Result 330 states and 443 transitions. [2021-10-24 10:08:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:12,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) 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-24 10:08:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:12,305 INFO L225 Difference]: With dead ends: 330 [2021-10-24 10:08:12,305 INFO L226 Difference]: Without dead ends: 325 [2021-10-24 10:08:12,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-24 10:08:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-10-24 10:08:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.394904458598726) internal successors, (438), 324 states have internal predecessors, (438), 0 states have call successors, (0), 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-24 10:08:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 438 transitions. [2021-10-24 10:08:12,334 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 438 transitions. Word has length 20 [2021-10-24 10:08:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:12,334 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 438 transitions. [2021-10-24 10:08:12,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) 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-24 10:08:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 438 transitions. [2021-10-24 10:08:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-24 10:08:12,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:12,336 INFO L512 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-24 10:08:12,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 10:08:12,337 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:12,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2030436846, now seen corresponding path program 1 times [2021-10-24 10:08:12,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:12,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138798432] [2021-10-24 10:08:12,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:12,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:12,389 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-24 10:08:12,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:12,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138798432] [2021-10-24 10:08:12,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138798432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:12,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:12,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:12,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440446648] [2021-10-24 10:08:12,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:12,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,394 INFO L87 Difference]: Start difference. First operand 325 states and 438 transitions. Second operand has 3 states, 3 states have (on average 7.0) 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-24 10:08:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:12,438 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2021-10-24 10:08:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) 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-24 10:08:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:12,441 INFO L225 Difference]: With dead ends: 418 [2021-10-24 10:08:12,441 INFO L226 Difference]: Without dead ends: 323 [2021-10-24 10:08:12,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-24 10:08:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2021-10-24 10:08:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 298 states have (on average 1.3791946308724832) internal successors, (411), 308 states have internal predecessors, (411), 0 states have call successors, (0), 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-24 10:08:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2021-10-24 10:08:12,465 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 21 [2021-10-24 10:08:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:12,467 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2021-10-24 10:08:12,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) 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-24 10:08:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2021-10-24 10:08:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-24 10:08:12,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:12,469 INFO L512 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-24 10:08:12,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-24 10:08:12,469 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:12,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash 612333619, now seen corresponding path program 1 times [2021-10-24 10:08:12,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:12,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823747564] [2021-10-24 10:08:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:12,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:12,524 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-24 10:08:12,524 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:12,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823747564] [2021-10-24 10:08:12,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823747564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:12,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:12,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:12,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837788446] [2021-10-24 10:08:12,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:12,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:12,528 INFO L87 Difference]: Start difference. First operand 309 states and 411 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-24 10:08:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:12,673 INFO L93 Difference]: Finished difference Result 314 states and 415 transitions. [2021-10-24 10:08:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:12,673 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-24 10:08:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:12,676 INFO L225 Difference]: With dead ends: 314 [2021-10-24 10:08:12,676 INFO L226 Difference]: Without dead ends: 309 [2021-10-24 10:08:12,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-24 10:08:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-10-24 10:08:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 298 states have (on average 1.3758389261744965) internal successors, (410), 308 states have internal predecessors, (410), 0 states have call successors, (0), 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-24 10:08:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 410 transitions. [2021-10-24 10:08:12,699 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 410 transitions. Word has length 21 [2021-10-24 10:08:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:12,699 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 410 transitions. [2021-10-24 10:08:12,699 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-24 10:08:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 410 transitions. [2021-10-24 10:08:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-24 10:08:12,701 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:12,701 INFO L512 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-24 10:08:12,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 10:08:12,701 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1058451947, now seen corresponding path program 1 times [2021-10-24 10:08:12,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:12,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400876426] [2021-10-24 10:08:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:12,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:12,750 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-24 10:08:12,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:12,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400876426] [2021-10-24 10:08:12,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400876426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:12,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:12,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:12,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545950248] [2021-10-24 10:08:12,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:12,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:12,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:12,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,753 INFO L87 Difference]: Start difference. First operand 309 states and 410 transitions. Second operand has 3 states, 3 states have (on average 7.0) 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-24 10:08:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:12,785 INFO L93 Difference]: Finished difference Result 349 states and 455 transitions. [2021-10-24 10:08:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:12,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) 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-24 10:08:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:12,788 INFO L225 Difference]: With dead ends: 349 [2021-10-24 10:08:12,789 INFO L226 Difference]: Without dead ends: 295 [2021-10-24 10:08:12,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-24 10:08:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2021-10-24 10:08:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.3652482269503545) internal successors, (385), 292 states have internal predecessors, (385), 0 states have call successors, (0), 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-24 10:08:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2021-10-24 10:08:12,810 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 21 [2021-10-24 10:08:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:12,810 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2021-10-24 10:08:12,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) 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-24 10:08:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2021-10-24 10:08:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:08:12,812 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:12,812 INFO L512 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-24 10:08:12,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-24 10:08:12,812 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:12,813 INFO L82 PathProgramCache]: Analyzing trace with hash -420836383, now seen corresponding path program 1 times [2021-10-24 10:08:12,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:12,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836255602] [2021-10-24 10:08:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:12,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:12,849 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-24 10:08:12,850 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:12,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836255602] [2021-10-24 10:08:12,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836255602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:12,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:12,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:12,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562495616] [2021-10-24 10:08:12,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:12,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,852 INFO L87 Difference]: Start difference. First operand 293 states and 385 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-24 10:08:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:12,986 INFO L93 Difference]: Finished difference Result 344 states and 448 transitions. [2021-10-24 10:08:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:12,987 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-24 10:08:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:12,989 INFO L225 Difference]: With dead ends: 344 [2021-10-24 10:08:12,989 INFO L226 Difference]: Without dead ends: 336 [2021-10-24 10:08:12,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-24 10:08:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2021-10-24 10:08:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.3689655172413793) internal successors, (397), 300 states have internal predecessors, (397), 0 states have call successors, (0), 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-24 10:08:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2021-10-24 10:08:13,013 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 22 [2021-10-24 10:08:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:13,013 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2021-10-24 10:08:13,013 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-24 10:08:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2021-10-24 10:08:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:08:13,017 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:13,017 INFO L512 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-24 10:08:13,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-24 10:08:13,018 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1442209585, now seen corresponding path program 1 times [2021-10-24 10:08:13,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:13,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108948837] [2021-10-24 10:08:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:13,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:13,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-24 10:08:13,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:13,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108948837] [2021-10-24 10:08:13,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108948837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:13,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:13,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:08:13,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659849132] [2021-10-24 10:08:13,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:13,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:13,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:13,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:13,061 INFO L87 Difference]: Start difference. First operand 301 states and 397 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-24 10:08:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:13,104 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2021-10-24 10:08:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:13,104 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-24 10:08:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:13,106 INFO L225 Difference]: With dead ends: 314 [2021-10-24 10:08:13,107 INFO L226 Difference]: Without dead ends: 299 [2021-10-24 10:08:13,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-24 10:08:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-24 10:08:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.3680555555555556) internal successors, (394), 298 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-24 10:08:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 394 transitions. [2021-10-24 10:08:13,130 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 394 transitions. Word has length 22 [2021-10-24 10:08:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:13,132 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 394 transitions. [2021-10-24 10:08:13,132 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-24 10:08:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 394 transitions. [2021-10-24 10:08:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:08:13,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:13,134 INFO L512 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-24 10:08:13,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-24 10:08:13,135 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash 375582176, now seen corresponding path program 1 times [2021-10-24 10:08:13,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:13,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759447800] [2021-10-24 10:08:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:13,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:13,204 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-24 10:08:13,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:13,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759447800] [2021-10-24 10:08:13,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759447800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:13,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:13,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:08:13,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896186301] [2021-10-24 10:08:13,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:13,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:13,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:13,208 INFO L87 Difference]: Start difference. First operand 299 states and 394 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-24 10:08:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:13,259 INFO L93 Difference]: Finished difference Result 337 states and 433 transitions. [2021-10-24 10:08:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:13,260 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-24 10:08:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:13,262 INFO L225 Difference]: With dead ends: 337 [2021-10-24 10:08:13,262 INFO L226 Difference]: Without dead ends: 316 [2021-10-24 10:08:13,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-24 10:08:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2021-10-24 10:08:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.3655172413793104) internal successors, (396), 300 states have internal predecessors, (396), 0 states have call successors, (0), 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-24 10:08:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 396 transitions. [2021-10-24 10:08:13,311 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 396 transitions. Word has length 22 [2021-10-24 10:08:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:13,311 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 396 transitions. [2021-10-24 10:08:13,311 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-24 10:08:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 396 transitions. [2021-10-24 10:08:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-24 10:08:13,313 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:13,313 INFO L512 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-24 10:08:13,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-24 10:08:13,314 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash 638524463, now seen corresponding path program 1 times [2021-10-24 10:08:13,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:13,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066164597] [2021-10-24 10:08:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:13,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:13,366 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-24 10:08:13,366 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:13,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066164597] [2021-10-24 10:08:13,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066164597] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:13,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:13,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:08:13,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938560488] [2021-10-24 10:08:13,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:13,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:13,369 INFO L87 Difference]: Start difference. First operand 301 states and 396 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-24 10:08:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:13,419 INFO L93 Difference]: Finished difference Result 314 states and 408 transitions. [2021-10-24 10:08:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:13,420 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-24 10:08:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:13,422 INFO L225 Difference]: With dead ends: 314 [2021-10-24 10:08:13,422 INFO L226 Difference]: Without dead ends: 299 [2021-10-24 10:08:13,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-24 10:08:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-24 10:08:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.3645833333333333) internal successors, (393), 298 states have internal predecessors, (393), 0 states have call successors, (0), 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-24 10:08:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2021-10-24 10:08:13,446 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 22 [2021-10-24 10:08:13,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:13,446 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2021-10-24 10:08:13,446 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-24 10:08:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2021-10-24 10:08:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-24 10:08:13,447 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:13,447 INFO L512 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-24 10:08:13,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-24 10:08:13,448 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash -168683918, now seen corresponding path program 1 times [2021-10-24 10:08:13,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:13,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337752266] [2021-10-24 10:08:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:13,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:13,492 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-24 10:08:13,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:13,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337752266] [2021-10-24 10:08:13,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337752266] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:13,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:13,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:13,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367453098] [2021-10-24 10:08:13,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:13,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:13,495 INFO L87 Difference]: Start difference. First operand 299 states and 393 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-24 10:08:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:13,693 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2021-10-24 10:08:13,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:13,693 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-24 10:08:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:13,696 INFO L225 Difference]: With dead ends: 341 [2021-10-24 10:08:13,697 INFO L226 Difference]: Without dead ends: 314 [2021-10-24 10:08:13,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-24 10:08:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2021-10-24 10:08:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 284 states have (on average 1.3556338028169015) internal successors, (385), 293 states have internal predecessors, (385), 0 states have call successors, (0), 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-24 10:08:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2021-10-24 10:08:13,722 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 23 [2021-10-24 10:08:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:13,723 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2021-10-24 10:08:13,723 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-24 10:08:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2021-10-24 10:08:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-24 10:08:13,724 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:13,724 INFO L512 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-24 10:08:13,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-24 10:08:13,725 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash -130301320, now seen corresponding path program 1 times [2021-10-24 10:08:13,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:13,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718646153] [2021-10-24 10:08:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:13,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:13,763 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-24 10:08:13,763 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:13,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718646153] [2021-10-24 10:08:13,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718646153] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:13,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:13,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:13,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279088028] [2021-10-24 10:08:13,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:13,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:13,767 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) 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-24 10:08:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:13,812 INFO L93 Difference]: Finished difference Result 411 states and 527 transitions. [2021-10-24 10:08:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:13,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) 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-24 10:08:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:13,815 INFO L225 Difference]: With dead ends: 411 [2021-10-24 10:08:13,815 INFO L226 Difference]: Without dead ends: 317 [2021-10-24 10:08:13,816 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-24 10:08:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2021-10-24 10:08:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 281 states have internal predecessors, (367), 0 states have call successors, (0), 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-24 10:08:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 367 transitions. [2021-10-24 10:08:13,841 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 367 transitions. Word has length 23 [2021-10-24 10:08:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:13,841 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 367 transitions. [2021-10-24 10:08:13,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) 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-24 10:08:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 367 transitions. [2021-10-24 10:08:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-24 10:08:13,843 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:13,843 INFO L512 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-24 10:08:13,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-24 10:08:13,845 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash -662751181, now seen corresponding path program 1 times [2021-10-24 10:08:13,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:13,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088999372] [2021-10-24 10:08:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:13,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:14,015 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-24 10:08:14,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:14,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088999372] [2021-10-24 10:08:14,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088999372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:14,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:14,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:14,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973360694] [2021-10-24 10:08:14,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:14,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:14,019 INFO L87 Difference]: Start difference. First operand 282 states and 367 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-24 10:08:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:14,083 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2021-10-24 10:08:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:14,083 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-24 10:08:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:14,085 INFO L225 Difference]: With dead ends: 382 [2021-10-24 10:08:14,085 INFO L226 Difference]: Without dead ends: 284 [2021-10-24 10:08:14,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-24 10:08:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 270. [2021-10-24 10:08:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.321969696969697) internal successors, (349), 269 states have internal predecessors, (349), 0 states have call successors, (0), 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-24 10:08:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2021-10-24 10:08:14,116 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 24 [2021-10-24 10:08:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:14,117 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2021-10-24 10:08:14,117 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-24 10:08:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2021-10-24 10:08:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-24 10:08:14,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:14,119 INFO L512 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-24 10:08:14,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-24 10:08:14,119 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:14,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1269559156, now seen corresponding path program 1 times [2021-10-24 10:08:14,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:14,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079366676] [2021-10-24 10:08:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:14,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:14,159 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-24 10:08:14,159 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:14,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079366676] [2021-10-24 10:08:14,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079366676] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:14,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:14,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:14,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430161293] [2021-10-24 10:08:14,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:14,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:14,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:14,161 INFO L87 Difference]: Start difference. First operand 270 states and 349 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-24 10:08:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:14,302 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2021-10-24 10:08:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:14,302 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-24 10:08:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:14,305 INFO L225 Difference]: With dead ends: 360 [2021-10-24 10:08:14,305 INFO L226 Difference]: Without dead ends: 340 [2021-10-24 10:08:14,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-24 10:08:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-10-24 10:08:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 280 states have (on average 1.3035714285714286) internal successors, (365), 285 states have internal predecessors, (365), 0 states have call successors, (0), 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-24 10:08:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 365 transitions. [2021-10-24 10:08:14,336 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 365 transitions. Word has length 24 [2021-10-24 10:08:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:14,338 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 365 transitions. [2021-10-24 10:08:14,338 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-24 10:08:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 365 transitions. [2021-10-24 10:08:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-24 10:08:14,339 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:14,339 INFO L512 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-24 10:08:14,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-24 10:08:14,340 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1364391258, now seen corresponding path program 1 times [2021-10-24 10:08:14,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:14,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391082933] [2021-10-24 10:08:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:14,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:14,398 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-24 10:08:14,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:14,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391082933] [2021-10-24 10:08:14,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391082933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:14,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:14,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:14,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384418478] [2021-10-24 10:08:14,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:14,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:14,402 INFO L87 Difference]: Start difference. First operand 286 states and 365 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-24 10:08:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:14,471 INFO L93 Difference]: Finished difference Result 299 states and 377 transitions. [2021-10-24 10:08:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:14,472 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-24 10:08:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:14,474 INFO L225 Difference]: With dead ends: 299 [2021-10-24 10:08:14,474 INFO L226 Difference]: Without dead ends: 282 [2021-10-24 10:08:14,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-24 10:08:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-10-24 10:08:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.3043478260869565) internal successors, (360), 281 states have internal predecessors, (360), 0 states have call successors, (0), 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-24 10:08:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2021-10-24 10:08:14,503 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 24 [2021-10-24 10:08:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:14,503 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2021-10-24 10:08:14,503 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-24 10:08:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2021-10-24 10:08:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-24 10:08:14,504 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:14,504 INFO L512 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-24 10:08:14,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-24 10:08:14,505 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:14,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:14,505 INFO L82 PathProgramCache]: Analyzing trace with hash -896029021, now seen corresponding path program 1 times [2021-10-24 10:08:14,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:14,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786905359] [2021-10-24 10:08:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:14,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:14,578 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-24 10:08:14,578 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:14,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786905359] [2021-10-24 10:08:14,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786905359] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:14,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:14,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:14,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979614355] [2021-10-24 10:08:14,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:14,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:14,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:14,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:14,582 INFO L87 Difference]: Start difference. First operand 282 states and 360 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-24 10:08:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:14,769 INFO L93 Difference]: Finished difference Result 368 states and 467 transitions. [2021-10-24 10:08:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:14,769 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-24 10:08:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:14,771 INFO L225 Difference]: With dead ends: 368 [2021-10-24 10:08:14,772 INFO L226 Difference]: Without dead ends: 282 [2021-10-24 10:08:14,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-24 10:08:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-10-24 10:08:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2934782608695652) internal successors, (357), 281 states have internal predecessors, (357), 0 states have call successors, (0), 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-24 10:08:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 357 transitions. [2021-10-24 10:08:14,808 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 357 transitions. Word has length 25 [2021-10-24 10:08:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:14,809 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 357 transitions. [2021-10-24 10:08:14,809 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-24 10:08:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 357 transitions. [2021-10-24 10:08:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-24 10:08:14,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:14,810 INFO L512 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-24 10:08:14,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-24 10:08:14,811 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 719084810, now seen corresponding path program 1 times [2021-10-24 10:08:14,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:14,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126521526] [2021-10-24 10:08:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:14,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:14,869 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-24 10:08:14,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:14,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126521526] [2021-10-24 10:08:14,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126521526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:14,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:14,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:14,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567913481] [2021-10-24 10:08:14,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:14,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:14,873 INFO L87 Difference]: Start difference. First operand 282 states and 357 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-24 10:08:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:15,026 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2021-10-24 10:08:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:15,027 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-24 10:08:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:15,029 INFO L225 Difference]: With dead ends: 287 [2021-10-24 10:08:15,029 INFO L226 Difference]: Without dead ends: 284 [2021-10-24 10:08:15,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-24 10:08:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-10-24 10:08:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 278 states have (on average 1.29136690647482) internal successors, (359), 283 states have internal predecessors, (359), 0 states have call successors, (0), 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-24 10:08:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2021-10-24 10:08:15,062 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 25 [2021-10-24 10:08:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:15,062 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2021-10-24 10:08:15,062 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-24 10:08:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2021-10-24 10:08:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-24 10:08:15,063 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:15,063 INFO L512 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-24 10:08:15,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-24 10:08:15,064 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash 719096726, now seen corresponding path program 1 times [2021-10-24 10:08:15,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:15,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628955057] [2021-10-24 10:08:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:15,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:08:15,105 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:15,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628955057] [2021-10-24 10:08:15,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628955057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:15,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:15,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:15,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958333990] [2021-10-24 10:08:15,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:15,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:15,108 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-24 10:08:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:15,267 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-10-24 10:08:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:08:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-24 10:08:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:15,270 INFO L225 Difference]: With dead ends: 342 [2021-10-24 10:08:15,270 INFO L226 Difference]: Without dead ends: 328 [2021-10-24 10:08:15,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-24 10:08:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2021-10-24 10:08:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2836879432624113) internal successors, (362), 287 states have internal predecessors, (362), 0 states have call successors, (0), 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-24 10:08:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 362 transitions. [2021-10-24 10:08:15,302 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 362 transitions. Word has length 25 [2021-10-24 10:08:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:15,302 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 362 transitions. [2021-10-24 10:08:15,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-24 10:08:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 362 transitions. [2021-10-24 10:08:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-24 10:08:15,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:15,304 INFO L512 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-24 10:08:15,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-24 10:08:15,304 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1275592658, now seen corresponding path program 1 times [2021-10-24 10:08:15,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:15,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773491568] [2021-10-24 10:08:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:15,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:15,355 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-24 10:08:15,355 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:15,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773491568] [2021-10-24 10:08:15,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773491568] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:15,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:15,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:15,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794986740] [2021-10-24 10:08:15,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:15,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:15,358 INFO L87 Difference]: Start difference. First operand 288 states and 362 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-24 10:08:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:15,500 INFO L93 Difference]: Finished difference Result 337 states and 413 transitions. [2021-10-24 10:08:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:15,501 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-24 10:08:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:15,503 INFO L225 Difference]: With dead ends: 337 [2021-10-24 10:08:15,503 INFO L226 Difference]: Without dead ends: 288 [2021-10-24 10:08:15,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-24 10:08:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-10-24 10:08:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 287 states have internal predecessors, (354), 0 states have call successors, (0), 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-24 10:08:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-10-24 10:08:15,552 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 25 [2021-10-24 10:08:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:15,552 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-10-24 10:08:15,553 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-24 10:08:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-10-24 10:08:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-24 10:08:15,554 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:15,554 INFO L512 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] [2021-10-24 10:08:15,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-24 10:08:15,554 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 513282031, now seen corresponding path program 1 times [2021-10-24 10:08:15,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:15,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462856624] [2021-10-24 10:08:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:15,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:15,622 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-24 10:08:15,622 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:15,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462856624] [2021-10-24 10:08:15,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462856624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:15,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:15,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:15,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368587105] [2021-10-24 10:08:15,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:15,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:15,625 INFO L87 Difference]: Start difference. First operand 288 states and 354 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-24 10:08:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:15,861 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-10-24 10:08:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:08:15,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-24 10:08:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:15,864 INFO L225 Difference]: With dead ends: 342 [2021-10-24 10:08:15,864 INFO L226 Difference]: Without dead ends: 338 [2021-10-24 10:08:15,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-24 10:08:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2021-10-24 10:08:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 287 states have internal predecessors, (354), 0 states have call successors, (0), 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-24 10:08:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-10-24 10:08:15,896 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 26 [2021-10-24 10:08:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:15,896 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-10-24 10:08:15,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-24 10:08:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-10-24 10:08:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-24 10:08:15,897 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:15,897 INFO L512 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] [2021-10-24 10:08:15,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-24 10:08:15,898 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1329987784, now seen corresponding path program 1 times [2021-10-24 10:08:15,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:15,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975217405] [2021-10-24 10:08:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:15,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:15,990 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-24 10:08:15,991 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:15,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975217405] [2021-10-24 10:08:15,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975217405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:15,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:15,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:08:15,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128834471] [2021-10-24 10:08:15,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:08:15,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:08:15,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:15,995 INFO L87 Difference]: Start difference. First operand 288 states and 354 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-24 10:08:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:16,168 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2021-10-24 10:08:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 10:08:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-24 10:08:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:16,171 INFO L225 Difference]: With dead ends: 321 [2021-10-24 10:08:16,171 INFO L226 Difference]: Without dead ends: 303 [2021-10-24 10:08:16,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-24 10:08:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-24 10:08:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2021-10-24 10:08:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2210144927536233) internal successors, (337), 281 states have internal predecessors, (337), 0 states have call successors, (0), 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-24 10:08:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2021-10-24 10:08:16,205 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 26 [2021-10-24 10:08:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:16,205 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2021-10-24 10:08:16,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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-24 10:08:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2021-10-24 10:08:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-24 10:08:16,206 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:16,207 INFO L512 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] [2021-10-24 10:08:16,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-24 10:08:16,207 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash -937040231, now seen corresponding path program 1 times [2021-10-24 10:08:16,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:16,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604465847] [2021-10-24 10:08:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:16,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:16,247 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-24 10:08:16,247 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:16,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604465847] [2021-10-24 10:08:16,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604465847] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:16,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:16,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:16,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735520103] [2021-10-24 10:08:16,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:08:16,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:08:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:16,249 INFO L87 Difference]: Start difference. First operand 282 states and 337 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-24 10:08:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:16,359 INFO L93 Difference]: Finished difference Result 311 states and 364 transitions. [2021-10-24 10:08:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:08:16,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-24 10:08:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:16,361 INFO L225 Difference]: With dead ends: 311 [2021-10-24 10:08:16,361 INFO L226 Difference]: Without dead ends: 269 [2021-10-24 10:08:16,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:08:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-10-24 10:08:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2021-10-24 10:08:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 253 states have (on average 1.225296442687747) internal successors, (310), 258 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-24 10:08:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2021-10-24 10:08:16,392 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 26 [2021-10-24 10:08:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:16,392 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2021-10-24 10:08:16,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-24 10:08:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2021-10-24 10:08:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-24 10:08:16,393 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:16,394 INFO L512 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-24 10:08:16,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-24 10:08:16,394 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1033980549, now seen corresponding path program 1 times [2021-10-24 10:08:16,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:16,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637012847] [2021-10-24 10:08:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:16,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:16,454 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-24 10:08:16,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:16,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637012847] [2021-10-24 10:08:16,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637012847] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:16,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:16,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:16,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125737516] [2021-10-24 10:08:16,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:16,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:16,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:16,456 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-24 10:08:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:16,583 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-10-24 10:08:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-24 10:08:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:16,585 INFO L225 Difference]: With dead ends: 266 [2021-10-24 10:08:16,585 INFO L226 Difference]: Without dead ends: 237 [2021-10-24 10:08:16,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-24 10:08:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2021-10-24 10:08:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2378854625550662) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 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-24 10:08:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2021-10-24 10:08:16,613 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 27 [2021-10-24 10:08:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:16,613 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2021-10-24 10:08:16,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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-24 10:08:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2021-10-24 10:08:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-24 10:08:16,614 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:16,615 INFO L512 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-24 10:08:16,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-24 10:08:16,616 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -835413411, now seen corresponding path program 1 times [2021-10-24 10:08:16,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:16,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169617246] [2021-10-24 10:08:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:16,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:16,654 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-24 10:08:16,654 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:16,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169617246] [2021-10-24 10:08:16,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169617246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:16,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:16,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:16,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648732746] [2021-10-24 10:08:16,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:16,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:16,656 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-24 10:08:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:16,768 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2021-10-24 10:08:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-24 10:08:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:16,770 INFO L225 Difference]: With dead ends: 243 [2021-10-24 10:08:16,771 INFO L226 Difference]: Without dead ends: 238 [2021-10-24 10:08:16,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-24 10:08:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2021-10-24 10:08:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2334801762114538) internal successors, (280), 232 states have internal predecessors, (280), 0 states have call successors, (0), 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-24 10:08:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-10-24 10:08:16,800 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-10-24 10:08:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:16,801 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-10-24 10:08:16,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-24 10:08:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-10-24 10:08:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-24 10:08:16,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:16,802 INFO L512 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-24 10:08:16,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-24 10:08:16,803 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash -336964878, now seen corresponding path program 1 times [2021-10-24 10:08:16,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:16,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702271687] [2021-10-24 10:08:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:16,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:16,857 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-24 10:08:16,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:16,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702271687] [2021-10-24 10:08:16,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702271687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:16,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:16,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:16,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909964634] [2021-10-24 10:08:16,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:16,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:16,860 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-24 10:08:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:17,089 INFO L93 Difference]: Finished difference Result 263 states and 314 transitions. [2021-10-24 10:08:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:17,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-24 10:08:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:17,091 INFO L225 Difference]: With dead ends: 263 [2021-10-24 10:08:17,091 INFO L226 Difference]: Without dead ends: 261 [2021-10-24 10:08:17,092 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-24 10:08:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2021-10-24 10:08:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2334801762114538) internal successors, (280), 232 states have internal predecessors, (280), 0 states have call successors, (0), 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-24 10:08:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-10-24 10:08:17,120 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-10-24 10:08:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:17,120 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-10-24 10:08:17,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-24 10:08:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-10-24 10:08:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-24 10:08:17,122 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:17,122 INFO L512 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] [2021-10-24 10:08:17,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-24 10:08:17,123 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2033165494, now seen corresponding path program 1 times [2021-10-24 10:08:17,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:17,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269632854] [2021-10-24 10:08:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:17,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:17,171 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-24 10:08:17,171 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:17,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269632854] [2021-10-24 10:08:17,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269632854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:17,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:17,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:17,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071856142] [2021-10-24 10:08:17,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:17,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:17,174 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:08:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:17,267 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2021-10-24 10:08:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:17,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-24 10:08:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:17,269 INFO L225 Difference]: With dead ends: 247 [2021-10-24 10:08:17,269 INFO L226 Difference]: Without dead ends: 226 [2021-10-24 10:08:17,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-24 10:08:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-10-24 10:08:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 220 states have (on average 1.2272727272727273) internal successors, (270), 225 states have internal predecessors, (270), 0 states have call successors, (0), 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-24 10:08:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 270 transitions. [2021-10-24 10:08:17,299 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 270 transitions. Word has length 29 [2021-10-24 10:08:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:17,300 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 270 transitions. [2021-10-24 10:08:17,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:08:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 270 transitions. [2021-10-24 10:08:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-24 10:08:17,301 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:17,301 INFO L512 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] [2021-10-24 10:08:17,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-24 10:08:17,301 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -657637208, now seen corresponding path program 1 times [2021-10-24 10:08:17,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:17,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140239042] [2021-10-24 10:08:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:17,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:17,337 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-24 10:08:17,337 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:17,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140239042] [2021-10-24 10:08:17,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140239042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:17,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:17,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:08:17,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748103489] [2021-10-24 10:08:17,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:17,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:17,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:17,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:17,339 INFO L87 Difference]: Start difference. First operand 226 states and 270 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:08:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:17,447 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2021-10-24 10:08:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:17,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-24 10:08:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:17,449 INFO L225 Difference]: With dead ends: 231 [2021-10-24 10:08:17,449 INFO L226 Difference]: Without dead ends: 213 [2021-10-24 10:08:17,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-24 10:08:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-24 10:08:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 212 states have internal predecessors, (252), 0 states have call successors, (0), 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-24 10:08:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2021-10-24 10:08:17,479 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 29 [2021-10-24 10:08:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:17,479 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2021-10-24 10:08:17,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:08:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2021-10-24 10:08:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-24 10:08:17,480 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:17,480 INFO L512 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] [2021-10-24 10:08:17,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-24 10:08:17,481 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:17,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1797324549, now seen corresponding path program 1 times [2021-10-24 10:08:17,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:17,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703694391] [2021-10-24 10:08:17,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:17,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:17,520 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-24 10:08:17,520 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:17,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703694391] [2021-10-24 10:08:17,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703694391] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:17,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:17,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:17,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401976398] [2021-10-24 10:08:17,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:17,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:17,522 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:08:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:17,573 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2021-10-24 10:08:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:17,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-24 10:08:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:17,576 INFO L225 Difference]: With dead ends: 237 [2021-10-24 10:08:17,576 INFO L226 Difference]: Without dead ends: 213 [2021-10-24 10:08:17,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-24 10:08:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-24 10:08:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.21256038647343) internal successors, (251), 212 states have internal predecessors, (251), 0 states have call successors, (0), 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-24 10:08:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2021-10-24 10:08:17,602 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 29 [2021-10-24 10:08:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:17,603 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2021-10-24 10:08:17,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:08:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2021-10-24 10:08:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-24 10:08:17,604 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:17,604 INFO L512 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] [2021-10-24 10:08:17,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-24 10:08:17,604 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:17,605 INFO L82 PathProgramCache]: Analyzing trace with hash -505348968, now seen corresponding path program 1 times [2021-10-24 10:08:17,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:17,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407563459] [2021-10-24 10:08:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:17,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:17,668 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-24 10:08:17,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:17,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407563459] [2021-10-24 10:08:17,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407563459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:17,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:17,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:17,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376954999] [2021-10-24 10:08:17,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:17,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:17,671 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-24 10:08:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:17,804 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2021-10-24 10:08:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:08:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-10-24 10:08:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:17,806 INFO L225 Difference]: With dead ends: 234 [2021-10-24 10:08:17,806 INFO L226 Difference]: Without dead ends: 213 [2021-10-24 10:08:17,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-24 10:08:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2021-10-24 10:08:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.2131979695431472) internal successors, (239), 202 states have internal predecessors, (239), 0 states have call successors, (0), 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-24 10:08:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2021-10-24 10:08:17,834 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 30 [2021-10-24 10:08:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:17,834 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2021-10-24 10:08:17,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-24 10:08:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2021-10-24 10:08:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-24 10:08:17,835 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:17,835 INFO L512 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] [2021-10-24 10:08:17,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-24 10:08:17,836 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1799897054, now seen corresponding path program 1 times [2021-10-24 10:08:17,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:17,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69899548] [2021-10-24 10:08:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:17,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:17,890 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-24 10:08:17,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:17,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69899548] [2021-10-24 10:08:17,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69899548] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:17,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:17,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:17,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541005658] [2021-10-24 10:08:17,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:17,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:17,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:17,893 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-24 10:08:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:18,065 INFO L93 Difference]: Finished difference Result 279 states and 334 transitions. [2021-10-24 10:08:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:08:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-10-24 10:08:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:18,068 INFO L225 Difference]: With dead ends: 279 [2021-10-24 10:08:18,068 INFO L226 Difference]: Without dead ends: 211 [2021-10-24 10:08:18,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-24 10:08:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2021-10-24 10:08:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.202127659574468) internal successors, (226), 192 states have internal predecessors, (226), 0 states have call successors, (0), 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-24 10:08:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2021-10-24 10:08:18,112 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 30 [2021-10-24 10:08:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:18,113 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2021-10-24 10:08:18,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-24 10:08:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2021-10-24 10:08:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-24 10:08:18,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:18,114 INFO L512 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] [2021-10-24 10:08:18,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-24 10:08:18,115 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash -138267735, now seen corresponding path program 1 times [2021-10-24 10:08:18,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:18,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565286481] [2021-10-24 10:08:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:18,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:18,161 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-24 10:08:18,162 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:18,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565286481] [2021-10-24 10:08:18,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565286481] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:18,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:18,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:18,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145792633] [2021-10-24 10:08:18,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:18,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:18,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:18,165 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-24 10:08:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:18,212 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-10-24 10:08:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:18,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-10-24 10:08:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:18,214 INFO L225 Difference]: With dead ends: 203 [2021-10-24 10:08:18,214 INFO L226 Difference]: Without dead ends: 155 [2021-10-24 10:08:18,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-24 10:08:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-10-24 10:08:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 154 states have internal predecessors, (177), 0 states have call successors, (0), 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-24 10:08:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-10-24 10:08:18,238 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 31 [2021-10-24 10:08:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:18,238 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-10-24 10:08:18,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-24 10:08:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-10-24 10:08:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-24 10:08:18,239 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:18,239 INFO L512 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] [2021-10-24 10:08:18,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-24 10:08:18,240 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash 709117488, now seen corresponding path program 1 times [2021-10-24 10:08:18,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:18,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648262216] [2021-10-24 10:08:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:18,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:18,306 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-24 10:08:18,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:18,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648262216] [2021-10-24 10:08:18,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648262216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:18,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:18,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:18,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963668078] [2021-10-24 10:08:18,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:18,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:18,310 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-24 10:08:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:18,446 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2021-10-24 10:08:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:18,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-24 10:08:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:18,447 INFO L225 Difference]: With dead ends: 187 [2021-10-24 10:08:18,448 INFO L226 Difference]: Without dead ends: 163 [2021-10-24 10:08:18,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-24 10:08:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-10-24 10:08:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 147 states have internal predecessors, (168), 0 states have call successors, (0), 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-24 10:08:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2021-10-24 10:08:18,469 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 32 [2021-10-24 10:08:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:18,469 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2021-10-24 10:08:18,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-24 10:08:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2021-10-24 10:08:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-24 10:08:18,470 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:18,470 INFO L512 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] [2021-10-24 10:08:18,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-24 10:08:18,470 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1394718914, now seen corresponding path program 1 times [2021-10-24 10:08:18,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:18,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429835732] [2021-10-24 10:08:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:18,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:18,552 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-24 10:08:18,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:18,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429835732] [2021-10-24 10:08:18,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429835732] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:18,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:18,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:08:18,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043883971] [2021-10-24 10:08:18,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:08:18,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:08:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:18,555 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-24 10:08:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:18,710 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2021-10-24 10:08:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-24 10:08:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-10-24 10:08:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:18,712 INFO L225 Difference]: With dead ends: 164 [2021-10-24 10:08:18,712 INFO L226 Difference]: Without dead ends: 118 [2021-10-24 10:08:18,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:08:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-24 10:08:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-10-24 10:08:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.19) internal successors, (119), 101 states have internal predecessors, (119), 0 states have call successors, (0), 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-24 10:08:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-10-24 10:08:18,729 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 33 [2021-10-24 10:08:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:18,729 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-10-24 10:08:18,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-24 10:08:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-10-24 10:08:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-24 10:08:18,730 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:18,730 INFO L512 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] [2021-10-24 10:08:18,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-24 10:08:18,731 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1245231514, now seen corresponding path program 1 times [2021-10-24 10:08:18,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:18,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298002790] [2021-10-24 10:08:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:18,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:18,782 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-24 10:08:18,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:18,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298002790] [2021-10-24 10:08:18,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298002790] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:18,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:18,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:18,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905783399] [2021-10-24 10:08:18,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:18,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:18,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:18,785 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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-24 10:08:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:18,874 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2021-10-24 10:08:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-24 10:08:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:18,883 INFO L225 Difference]: With dead ends: 134 [2021-10-24 10:08:18,883 INFO L226 Difference]: Without dead ends: 132 [2021-10-24 10:08:18,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-10-24 10:08:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2021-10-24 10:08:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.19) internal successors, (119), 101 states have internal predecessors, (119), 0 states have call successors, (0), 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-24 10:08:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-10-24 10:08:18,901 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 36 [2021-10-24 10:08:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:18,901 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-10-24 10:08:18,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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-24 10:08:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-10-24 10:08:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-24 10:08:18,902 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:18,902 INFO L512 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] [2021-10-24 10:08:18,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-24 10:08:18,903 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 904695418, now seen corresponding path program 1 times [2021-10-24 10:08:18,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:18,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697619248] [2021-10-24 10:08:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:18,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:18,978 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-24 10:08:18,978 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:18,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697619248] [2021-10-24 10:08:18,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697619248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:18,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:18,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-24 10:08:18,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562205246] [2021-10-24 10:08:18,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-24 10:08:18,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-24 10:08:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:08:18,980 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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-24 10:08:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:19,097 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2021-10-24 10:08:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-24 10:08:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-10-24 10:08:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:19,098 INFO L225 Difference]: With dead ends: 118 [2021-10-24 10:08:19,098 INFO L226 Difference]: Without dead ends: 102 [2021-10-24 10:08:19,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 68.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-24 10:08:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-24 10:08:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-10-24 10:08:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.18) internal successors, (118), 101 states have internal predecessors, (118), 0 states have call successors, (0), 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-24 10:08:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-10-24 10:08:19,115 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 40 [2021-10-24 10:08:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:19,116 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-10-24 10:08:19,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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-24 10:08:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-10-24 10:08:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-24 10:08:19,117 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:19,117 INFO L512 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] [2021-10-24 10:08:19,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-24 10:08:19,117 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 173896077, now seen corresponding path program 1 times [2021-10-24 10:08:19,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:19,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390949013] [2021-10-24 10:08:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:19,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:19,167 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-24 10:08:19,167 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:19,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390949013] [2021-10-24 10:08:19,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390949013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:19,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:19,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:08:19,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260061881] [2021-10-24 10:08:19,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:08:19,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:08:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:19,170 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-24 10:08:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:19,266 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2021-10-24 10:08:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:08:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-10-24 10:08:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:19,268 INFO L225 Difference]: With dead ends: 129 [2021-10-24 10:08:19,268 INFO L226 Difference]: Without dead ends: 111 [2021-10-24 10:08:19,268 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:08:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-24 10:08:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-10-24 10:08:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 108 states have internal predecessors, (125), 0 states have call successors, (0), 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-24 10:08:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2021-10-24 10:08:19,289 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 40 [2021-10-24 10:08:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:19,290 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2021-10-24 10:08:19,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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-24 10:08:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2021-10-24 10:08:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-24 10:08:19,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:19,291 INFO L512 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] [2021-10-24 10:08:19,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-24 10:08:19,291 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1032182008, now seen corresponding path program 1 times [2021-10-24 10:08:19,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:19,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245113988] [2021-10-24 10:08:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:19,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:19,344 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-24 10:08:19,344 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:19,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245113988] [2021-10-24 10:08:19,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245113988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:19,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:19,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:08:19,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172006217] [2021-10-24 10:08:19,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:08:19,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:19,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:08:19,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:19,347 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-24 10:08:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:19,447 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2021-10-24 10:08:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:08:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-10-24 10:08:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:19,449 INFO L225 Difference]: With dead ends: 168 [2021-10-24 10:08:19,449 INFO L226 Difference]: Without dead ends: 116 [2021-10-24 10:08:19,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-24 10:08:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2021-10-24 10:08:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 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-24 10:08:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-10-24 10:08:19,467 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2021-10-24 10:08:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:19,468 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-10-24 10:08:19,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-24 10:08:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-10-24 10:08:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:08:19,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:19,469 INFO L512 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] [2021-10-24 10:08:19,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-24 10:08:19,469 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1597143897, now seen corresponding path program 1 times [2021-10-24 10:08:19,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:19,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640316796] [2021-10-24 10:08:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:19,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:19,520 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-24 10:08:19,520 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:19,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640316796] [2021-10-24 10:08:19,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640316796] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:19,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:19,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:08:19,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603866115] [2021-10-24 10:08:19,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:08:19,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:08:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:19,523 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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-24 10:08:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:19,595 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-10-24 10:08:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-24 10:08:19,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-10-24 10:08:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:19,596 INFO L225 Difference]: With dead ends: 101 [2021-10-24 10:08:19,597 INFO L226 Difference]: Without dead ends: 65 [2021-10-24 10:08:19,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-24 10:08:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-24 10:08:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-24 10:08:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 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-24 10:08:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-10-24 10:08:19,610 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 43 [2021-10-24 10:08:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:19,611 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-10-24 10:08:19,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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-24 10:08:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-10-24 10:08:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 10:08:19,612 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:19,612 INFO L512 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] [2021-10-24 10:08:19,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-24 10:08:19,612 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1037680409, now seen corresponding path program 1 times [2021-10-24 10:08:19,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:19,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478403659] [2021-10-24 10:08:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:19,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 10:08:19,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:19,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478403659] [2021-10-24 10:08:19,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478403659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:19,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:19,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:08:19,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961078553] [2021-10-24 10:08:19,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:08:19,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:08:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:08:19,652 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-24 10:08:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:19,691 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2021-10-24 10:08:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:08:19,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-10-24 10:08:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:19,692 INFO L225 Difference]: With dead ends: 93 [2021-10-24 10:08:19,693 INFO L226 Difference]: Without dead ends: 65 [2021-10-24 10:08:19,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:08:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-24 10:08:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-24 10:08:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 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-24 10:08:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-10-24 10:08:19,707 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2021-10-24 10:08:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:19,707 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-10-24 10:08:19,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-24 10:08:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-10-24 10:08:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-24 10:08:19,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:19,708 INFO L512 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] [2021-10-24 10:08:19,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-24 10:08:19,709 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1050287321, now seen corresponding path program 1 times [2021-10-24 10:08:19,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:19,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811101406] [2021-10-24 10:08:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:19,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:19,768 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-24 10:08:19,769 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:19,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811101406] [2021-10-24 10:08:19,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811101406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:19,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:19,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-24 10:08:19,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142295515] [2021-10-24 10:08:19,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:08:19,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:08:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:08:19,771 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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-24 10:08:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:19,851 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-10-24 10:08:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:08:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-10-24 10:08:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:19,853 INFO L225 Difference]: With dead ends: 83 [2021-10-24 10:08:19,853 INFO L226 Difference]: Without dead ends: 65 [2021-10-24 10:08:19,853 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:08:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-24 10:08:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-24 10:08:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 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-24 10:08:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-10-24 10:08:19,881 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 52 [2021-10-24 10:08:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:19,882 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-10-24 10:08:19,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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-24 10:08:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-10-24 10:08:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-24 10:08:19,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:19,883 INFO L512 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] [2021-10-24 10:08:19,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-24 10:08:19,883 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1433729709, now seen corresponding path program 1 times [2021-10-24 10:08:19,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:19,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420376015] [2021-10-24 10:08:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:19,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:20,001 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-24 10:08:20,001 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:20,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420376015] [2021-10-24 10:08:20,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420376015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:20,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:20,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-24 10:08:20,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723017491] [2021-10-24 10:08:20,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-24 10:08:20,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-24 10:08:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-24 10:08:20,003 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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-24 10:08:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:20,275 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-10-24 10:08:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-24 10:08:20,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-10-24 10:08:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:20,277 INFO L225 Difference]: With dead ends: 110 [2021-10-24 10:08:20,277 INFO L226 Difference]: Without dead ends: 62 [2021-10-24 10:08:20,278 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 176.1ms TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-10-24 10:08:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-24 10:08:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-24 10:08:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 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-24 10:08:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-10-24 10:08:20,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 54 [2021-10-24 10:08:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:20,290 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-10-24 10:08:20,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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-24 10:08:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-10-24 10:08:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-24 10:08:20,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:08:20,291 INFO L512 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] [2021-10-24 10:08:20,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-24 10:08:20,292 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-24 10:08:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:08:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -481267565, now seen corresponding path program 1 times [2021-10-24 10:08:20,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:08:20,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35495977] [2021-10-24 10:08:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:08:20,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:08:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:08:20,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-24 10:08:20,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:08:20,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35495977] [2021-10-24 10:08:20,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35495977] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:08:20,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:08:20,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-24 10:08:20,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735193709] [2021-10-24 10:08:20,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-24 10:08:20,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:08:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-24 10:08:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:08:20,406 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 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-24 10:08:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:08:20,605 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2021-10-24 10:08:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-24 10:08:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-10-24 10:08:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:08:20,606 INFO L225 Difference]: With dead ends: 77 [2021-10-24 10:08:20,606 INFO L226 Difference]: Without dead ends: 0 [2021-10-24 10:08:20,606 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 156.8ms TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-10-24 10:08:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-24 10:08:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-24 10:08:20,607 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-24 10:08:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-24 10:08:20,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2021-10-24 10:08:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:08:20,607 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-24 10:08:20,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 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-24 10:08:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-24 10:08:20,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-24 10:08:20,610 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,610 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,610 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,610 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,610 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,612 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,613 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,613 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,614 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,614 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,614 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,614 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,614 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,616 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,616 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,616 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,616 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,616 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,618 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,619 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,619 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,619 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,619 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 10:08:20,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-24 10:08:20,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-24 10:08:20,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:20,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:21,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:22,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 10:08:32,027 INFO L857 garLoopResultBuilder]: For program point L1026-2(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,028 INFO L857 garLoopResultBuilder]: For program point L1026-4(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,028 INFO L857 garLoopResultBuilder]: For program point L1026-6(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,028 INFO L857 garLoopResultBuilder]: For program point L1026-8(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,028 INFO L857 garLoopResultBuilder]: For program point L1026-10(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,028 INFO L857 garLoopResultBuilder]: For program point L1026-12(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L1026-14(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L1026-16(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L1026-18(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L1026-20(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L236-1(lines 229 417) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L1297(lines 1297 1311) no Hoare annotation was computed. [2021-10-24 10:08:32,029 INFO L857 garLoopResultBuilder]: For program point L240(lines 240 246) no Hoare annotation was computed. [2021-10-24 10:08:32,030 INFO L857 garLoopResultBuilder]: For program point L637(lines 637 642) no Hoare annotation was computed. [2021-10-24 10:08:32,030 INFO L857 garLoopResultBuilder]: For program point L637-2(lines 637 642) no Hoare annotation was computed. [2021-10-24 10:08:32,030 INFO L853 garLoopResultBuilder]: At program point L1562(lines 1183 1564) the Hoare annotation is: (let ((.cse13 (= ~pended~0 1)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= 7 ~IPC~0)) (.cse9 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse11 (= 2 ~DC~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse10 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~pended~0 0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse2 (= ~IPC~0 ~s~0) .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse10 .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse2 .cse3 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse14 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse12 .cse5 .cse6) (and .cse0 .cse11 .cse13 .cse2 .cse4 (= ~s~0 ~NP~0) .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse14 .cse12 (<= 4 ~SKIP2~0) .cse5 .cse6 (= ~SKIP2~0 ~s~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5 .cse6))) [2021-10-24 10:08:32,030 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1304) no Hoare annotation was computed. [2021-10-24 10:08:32,031 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,031 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,031 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-24 10:08:32,031 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-24 10:08:32,031 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,031 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,032 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 383) no Hoare annotation was computed. [2021-10-24 10:08:32,032 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,032 INFO L853 garLoopResultBuilder]: At program point L644(lines 612 646) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (<= ULTIMATE.start_main_~status~1 258)) (.cse3 (= 2 ~DC~0)) (.cse4 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2021-10-24 10:08:32,032 INFO L857 garLoopResultBuilder]: For program point L512(lines 512 517) no Hoare annotation was computed. [2021-10-24 10:08:32,033 INFO L853 garLoopResultBuilder]: At program point L512-2(lines 512 517) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,033 INFO L853 garLoopResultBuilder]: At program point L118(lines 118 148) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,033 INFO L857 garLoopResultBuilder]: For program point L118-2(lines 110 158) no Hoare annotation was computed. [2021-10-24 10:08:32,033 INFO L857 garLoopResultBuilder]: For program point L1043(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,033 INFO L853 garLoopResultBuilder]: At program point L118-3(lines 118 148) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,033 INFO L857 garLoopResultBuilder]: For program point L1043-2(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L118-5(lines 110 158) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L1043-4(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L1043-6(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L1043-8(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L1043-10(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L1043-12(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,034 INFO L857 garLoopResultBuilder]: For program point L1043-14(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,035 INFO L857 garLoopResultBuilder]: For program point L1043-16(lines 1043 1049) no Hoare annotation was computed. [2021-10-24 10:08:32,035 INFO L857 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2021-10-24 10:08:32,035 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,035 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,035 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,035 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,036 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,036 INFO L853 garLoopResultBuilder]: At program point L787(lines 780 835) the Hoare annotation is: (let ((.cse18 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse20 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= 4 ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= 7 ~IPC~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse7 (= 2 ~DC~0)) (.cse21 (= ~pended~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse23 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (= ~pended~0 0)) (.cse22 (= ~compRegistered~0 0))) (or (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse6 .cse1 .cse7 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse5 .cse13 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse7 .cse17 .cse18 .cse19 .cse5) (and .cse15 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 (or .cse20 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse11 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse19 .cse5) (and .cse0 .cse1 .cse7 .cse21 .cse4 .cse18 .cse22) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse22) (and .cse14 .cse15 .cse16 .cse1 .cse7 .cse17 .cse11 .cse19 .cse12 .cse5 .cse13) (and .cse23 .cse0 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5) (and .cse6 .cse15 .cse0 .cse20 .cse1 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8 .cse3 .cse9 .cse4 .cse10 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse19 .cse12 .cse5) (and .cse14 .cse15 .cse0 .cse1 .cse7 .cse21 .cse11 .cse19 .cse22 .cse13) (and .cse23 .cse0 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4 .cse5) (and .cse2 (= ULTIMATE.start_main_~status~1 0) .cse5 .cse22))) [2021-10-24 10:08:32,036 INFO L853 garLoopResultBuilder]: At program point L1316(lines 1316 1550) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,036 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 291) no Hoare annotation was computed. [2021-10-24 10:08:32,037 INFO L857 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2021-10-24 10:08:32,037 INFO L853 garLoopResultBuilder]: At program point L129(lines 129 136) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,037 INFO L853 garLoopResultBuilder]: At program point L129-1(lines 129 136) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,037 INFO L857 garLoopResultBuilder]: For program point L1452(lines 1452 1455) no Hoare annotation was computed. [2021-10-24 10:08:32,037 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,038 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 593) no Hoare annotation was computed. [2021-10-24 10:08:32,038 INFO L857 garLoopResultBuilder]: For program point L528-1(lines 528 593) no Hoare annotation was computed. [2021-10-24 10:08:32,038 INFO L853 garLoopResultBuilder]: At program point L1321(lines 1321 1548) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,038 INFO L857 garLoopResultBuilder]: For program point L530(lines 530 570) no Hoare annotation was computed. [2021-10-24 10:08:32,039 INFO L853 garLoopResultBuilder]: At program point L795(lines 788 834) the Hoare annotation is: (let ((.cse0 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse7 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse9 (= 2 ~DC~0)) (.cse11 (= ~IPC~0 ~s~0)) (.cse21 (not (= ~MPR3~0 ~s~0))) (.cse20 (= ~pended~0 1)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse6 (<= 7 ~IPC~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse22 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= ~s~0 ~DC~0)) (.cse17 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (= 2 ~s~0)) (.cse18 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (not (= ~IPC~0 2))) (.cse19 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse12 .cse14 .cse15) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse16 .cse8 .cse9 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse17 .cse18 .cse19 .cse13 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse14 .cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse8 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse5 .cse6 .cse1 .cse8 .cse9 .cse20 .cse13 .cse12 .cse15 .cse21) (and .cse1 .cse8 .cse9 .cse20 .cse4 .cse11 .cse21) (and .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse1 .cse8 (or .cse22 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse13 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse12) (and .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) (and .cse1 .cse2 .cse20 .cse3 .cse4) (and .cse16 .cse6 .cse1 .cse22 .cse8 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse17 .cse3 .cse18 .cse4 .cse19 .cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse12 .cse14))) [2021-10-24 10:08:32,039 INFO L853 garLoopResultBuilder]: At program point L531(lines 531 541) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,039 INFO L860 garLoopResultBuilder]: At program point L796(lines 780 835) the Hoare annotation is: true [2021-10-24 10:08:32,039 INFO L853 garLoopResultBuilder]: At program point L664(lines 724 726) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,039 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 832) no Hoare annotation was computed. [2021-10-24 10:08:32,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,040 INFO L857 garLoopResultBuilder]: For program point L798(lines 798 831) no Hoare annotation was computed. [2021-10-24 10:08:32,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,040 INFO L857 garLoopResultBuilder]: For program point L1591-2(lines 1589 1620) no Hoare annotation was computed. [2021-10-24 10:08:32,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,041 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 809) no Hoare annotation was computed. [2021-10-24 10:08:32,041 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 277) no Hoare annotation was computed. [2021-10-24 10:08:32,041 INFO L857 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-10-24 10:08:32,041 INFO L853 garLoopResultBuilder]: At program point L1594-1(lines 1594 1618) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~compRegistered~0 0))) (or (and .cse0 (<= (+ 5 ~NP~0) ~MPR3~0) (= ~s~0 ~DC~0) .cse1 (= 2 ~s~0) .cse2 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) (= ~pended~0 0) .cse3) (and .cse0 (= 2 ~DC~0) (= ~pended~0 1) .cse1 .cse2 (= ~s~0 ~NP~0) .cse3))) [2021-10-24 10:08:32,041 INFO L857 garLoopResultBuilder]: For program point L1462(lines 1462 1482) no Hoare annotation was computed. [2021-10-24 10:08:32,041 INFO L857 garLoopResultBuilder]: For program point L1330(lines 1330 1546) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1066(lines 1066 1085) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1066-1(lines 1066 1085) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1066-2(lines 1066 1085) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1066-3(lines 1066 1085) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1463(lines 1463 1466) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1067(lines 1067 1072) no Hoare annotation was computed. [2021-10-24 10:08:32,042 INFO L857 garLoopResultBuilder]: For program point L1067-2(lines 1067 1072) no Hoare annotation was computed. [2021-10-24 10:08:32,043 INFO L857 garLoopResultBuilder]: For program point L1067-4(lines 1067 1072) no Hoare annotation was computed. [2021-10-24 10:08:32,043 INFO L857 garLoopResultBuilder]: For program point L1067-6(lines 1067 1072) no Hoare annotation was computed. [2021-10-24 10:08:32,043 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,043 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 146) no Hoare annotation was computed. [2021-10-24 10:08:32,043 INFO L857 garLoopResultBuilder]: For program point L144-1(lines 144 146) no Hoare annotation was computed. [2021-10-24 10:08:32,043 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,044 INFO L853 garLoopResultBuilder]: At program point L543(lines 530 570) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,044 INFO L857 garLoopResultBuilder]: For program point L1468(lines 1468 1481) no Hoare annotation was computed. [2021-10-24 10:08:32,044 INFO L853 garLoopResultBuilder]: At program point L1074(lines 1066 1085) the Hoare annotation is: false [2021-10-24 10:08:32,044 INFO L853 garLoopResultBuilder]: At program point L1074-1(lines 1066 1085) the Hoare annotation is: false [2021-10-24 10:08:32,044 INFO L853 garLoopResultBuilder]: At program point L1074-2(lines 1066 1085) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,044 INFO L853 garLoopResultBuilder]: At program point L1074-3(lines 1066 1085) the Hoare annotation is: false [2021-10-24 10:08:32,045 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,045 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,045 INFO L857 garLoopResultBuilder]: For program point L1339(lines 1339 1544) no Hoare annotation was computed. [2021-10-24 10:08:32,045 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,045 INFO L853 garLoopResultBuilder]: At program point L811(lines 798 831) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse6 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (<= 7 ~IPC~0)) (.cse8 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse9 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse5 (= 2 ~DC~0)) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse14 (<= ULTIMATE.start_main_~status~1 258)) (.cse16 (or (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse12) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12))) (.cse13 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (not .cse3)) (.cse18 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse19 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse20 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse1 .cse5 (= ~pended~0 1) .cse4) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4) (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse9 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse13 .cse14 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse15 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse20) (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) (or .cse14 (<= 260 ULTIMATE.start_main_~status~1)) (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse16 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse19 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258))) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse13 .cse9 .cse5 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse15 .cse17 .cse10 .cse18 .cse19 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse20 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0))))) [2021-10-24 10:08:32,046 INFO L857 garLoopResultBuilder]: For program point L1472(lines 1472 1480) no Hoare annotation was computed. [2021-10-24 10:08:32,046 INFO L853 garLoopResultBuilder]: At program point L1340(lines 1330 1546) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,046 INFO L853 garLoopResultBuilder]: At program point L550-2(lines 550 566) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 .cse16 .cse17))))) [2021-10-24 10:08:32,046 INFO L853 garLoopResultBuilder]: At program point L418(lines 229 419) the Hoare annotation is: (let ((.cse2 (= 2 ~DC~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse13 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse16 (= ~s~0 ~DC~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse17 (= 2 ~s~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse6 .cse9) (and .cse10 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse1 .cse2 .cse4 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse12 .cse13 .cse7 .cse14 .cse15 .cse9) (and .cse1 .cse16 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse17 .cse12 .cse7 .cse8 .cse14 .cse15) (and .cse10 .cse1 .cse16 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse4 .cse11 .cse17 .cse12 .cse13 .cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse8 .cse14 .cse15) (and (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse0 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6))) [2021-10-24 10:08:32,047 INFO L857 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2021-10-24 10:08:32,047 INFO L853 garLoopResultBuilder]: At program point L1079-1(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,047 INFO L857 garLoopResultBuilder]: For program point L1079-2(lines 1079 1083) no Hoare annotation was computed. [2021-10-24 10:08:32,047 INFO L853 garLoopResultBuilder]: At program point L1079-3(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,047 INFO L857 garLoopResultBuilder]: For program point L1079-4(lines 1079 1083) no Hoare annotation was computed. [2021-10-24 10:08:32,048 INFO L853 garLoopResultBuilder]: At program point L1079-5(lines 1079 1083) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,048 INFO L857 garLoopResultBuilder]: For program point L1079-6(lines 1079 1083) no Hoare annotation was computed. [2021-10-24 10:08:32,048 INFO L853 garLoopResultBuilder]: At program point L1079-7(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ~pended~0 0)))) [2021-10-24 10:08:32,048 INFO L853 garLoopResultBuilder]: At program point L551(lines 550 566) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 .cse16 .cse17))))) [2021-10-24 10:08:32,048 INFO L857 garLoopResultBuilder]: For program point L1476(lines 1476 1479) no Hoare annotation was computed. [2021-10-24 10:08:32,049 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,049 INFO L857 garLoopResultBuilder]: For program point L817(lines 817 829) no Hoare annotation was computed. [2021-10-24 10:08:32,049 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,049 INFO L857 garLoopResultBuilder]: For program point L1610(lines 1610 1616) no Hoare annotation was computed. [2021-10-24 10:08:32,049 INFO L853 garLoopResultBuilder]: At program point L157(lines 97 159) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= ~compRegistered~0 0))) (or (and .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse2 (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) .cse3) (and (not (= ~SKIP2~0 2)) .cse0 (= ~pended~0 1) .cse1 (not (= ~IPC~0 2)) .cse2 .cse3))) [2021-10-24 10:08:32,049 INFO L853 garLoopResultBuilder]: At program point L157-1(lines 97 159) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse2 .cse3 .cse4 .cse5 (<= 4 ~SKIP2~0) (= ~pended~0 0) .cse6) (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-24 10:08:32,050 INFO L857 garLoopResultBuilder]: For program point L818(lines 818 822) no Hoare annotation was computed. [2021-10-24 10:08:32,050 INFO L857 garLoopResultBuilder]: For program point L1348(lines 1348 1542) no Hoare annotation was computed. [2021-10-24 10:08:32,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,050 INFO L853 garLoopResultBuilder]: At program point L1484(lines 1348 1542) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L295-1(lines 229 417) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,051 INFO L857 garLoopResultBuilder]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L956-10(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L956-12(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L956-14(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L956-16(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L956-18(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L956-20(lines 956 962) no Hoare annotation was computed. [2021-10-24 10:08:32,052 INFO L857 garLoopResultBuilder]: For program point L562(lines 562 564) no Hoare annotation was computed. [2021-10-24 10:08:32,053 INFO L853 garLoopResultBuilder]: At program point L431(lines 160 433) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~pended~0 0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse11 (not (= ~SKIP2~0 2))) (.cse12 (= ~s~0 ~DC~0)) (.cse14 (= ~pended~0 1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (= 2 ~s~0)) (.cse15 (not (= ~IPC~0 2))) (.cse16 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse3 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse4 .cse13 .cse5 .cse6 .cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse8 .cse9) (and .cse11 .cse1 .cse2 .cse14 .cse3 .cse15 (= ~IPC~0 ~s~0) .cse16) (and .cse11 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse12 .cse3 .cse13 .cse15 .cse9) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse11 .cse1 .cse2 .cse14 .cse3 .cse7 (<= (+ ~NP~0 4) ~MPR1~0) .cse16 .cse10) (and (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse11 .cse12 .cse14 .cse3 .cse13 .cse15 .cse16))) [2021-10-24 10:08:32,053 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,053 INFO L857 garLoopResultBuilder]: For program point L1357(lines 1357 1540) no Hoare annotation was computed. [2021-10-24 10:08:32,053 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,053 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 307) no Hoare annotation was computed. [2021-10-24 10:08:32,054 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,054 INFO L853 garLoopResultBuilder]: At program point L567(lines 528 593) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse18 (* 4294967296 .cse17))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse18 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse18 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse17 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse16))))) [2021-10-24 10:08:32,054 INFO L857 garLoopResultBuilder]: For program point L1362(lines 1362 1538) no Hoare annotation was computed. [2021-10-24 10:08:32,054 INFO L857 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,054 INFO L857 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,054 INFO L857 garLoopResultBuilder]: For program point L1627-2(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point L1627-3(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point L1627-4(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point L1627-5(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point L1627-6(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point L1627-7(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,055 INFO L857 garLoopResultBuilder]: For program point L1627-8(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-9(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-10(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-11(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-12(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-13(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-14(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,056 INFO L857 garLoopResultBuilder]: For program point L1627-15(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point L1627-16(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point L1627-17(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point L1627-18(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point L1627-19(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point L1627-20(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,057 INFO L857 garLoopResultBuilder]: For program point L1627-21(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-22(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-23(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-24(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-25(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-26(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-27(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,058 INFO L857 garLoopResultBuilder]: For program point L1627-28(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,059 INFO L857 garLoopResultBuilder]: For program point L1627-29(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,059 INFO L857 garLoopResultBuilder]: For program point L1627-30(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,059 INFO L853 garLoopResultBuilder]: At program point L1628(lines 1039 1052) the Hoare annotation is: (and (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,059 INFO L857 garLoopResultBuilder]: For program point L1627-31(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,059 INFO L853 garLoopResultBuilder]: At program point L1628-1(lines 1039 1052) the Hoare annotation is: (and (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,059 INFO L857 garLoopResultBuilder]: For program point L1627-32(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,060 INFO L853 garLoopResultBuilder]: At program point L1628-2(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,060 INFO L857 garLoopResultBuilder]: For program point L1627-33(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,060 INFO L853 garLoopResultBuilder]: At program point L1628-3(lines 1 1630) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,060 INFO L857 garLoopResultBuilder]: For program point L1627-34(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,060 INFO L853 garLoopResultBuilder]: At program point L1628-4(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,060 INFO L857 garLoopResultBuilder]: For program point L1627-35(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,060 INFO L853 garLoopResultBuilder]: At program point L1628-5(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,061 INFO L857 garLoopResultBuilder]: For program point L1627-36(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,061 INFO L857 garLoopResultBuilder]: For program point L1627-37(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,061 INFO L853 garLoopResultBuilder]: At program point L1628-7(lines 1 1630) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~pended~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse5 (<= 4 ~SKIP2~0) .cse6 .cse7 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 (not (= ~SKIP2~0 2)) .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-24 10:08:32,061 INFO L857 garLoopResultBuilder]: For program point L1627-38(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,061 INFO L853 garLoopResultBuilder]: At program point L1628-8(lines 1 1630) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,061 INFO L857 garLoopResultBuilder]: For program point L1627-39(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,062 INFO L853 garLoopResultBuilder]: At program point L1628-9(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,062 INFO L857 garLoopResultBuilder]: For program point L1627-40(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,062 INFO L857 garLoopResultBuilder]: For program point L1627-41(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,062 INFO L853 garLoopResultBuilder]: At program point L1628-11(lines 1 1630) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~pended~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse5 (<= 4 ~SKIP2~0) .cse6 .cse7 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 (not (= ~SKIP2~0 2)) .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-24 10:08:32,062 INFO L857 garLoopResultBuilder]: For program point L1627-42(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,062 INFO L857 garLoopResultBuilder]: For program point L1627-43(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,063 INFO L853 garLoopResultBuilder]: At program point L1628-13(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,063 INFO L857 garLoopResultBuilder]: For program point L1627-44(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,063 INFO L857 garLoopResultBuilder]: For program point L1627-45(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,063 INFO L857 garLoopResultBuilder]: For program point L1627-46(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,063 INFO L857 garLoopResultBuilder]: For program point L1627-47(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,063 INFO L853 garLoopResultBuilder]: At program point L1628-17(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,064 INFO L857 garLoopResultBuilder]: For program point L1627-48(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,064 INFO L857 garLoopResultBuilder]: For program point L1627-49(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,064 INFO L857 garLoopResultBuilder]: For program point L1627-50(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,064 INFO L853 garLoopResultBuilder]: At program point L1628-20(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,064 INFO L857 garLoopResultBuilder]: For program point L1627-51(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,064 INFO L857 garLoopResultBuilder]: For program point L1627-52(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,065 INFO L853 garLoopResultBuilder]: At program point L1628-22(lines 1039 1052) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (not (= ~SKIP2~0 2))) (.cse3 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse4 (= ~s~0 ~DC~0)) (.cse5 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (= 2 ~s~0)) (.cse9 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= (+ .cse19 1) 0)) (.cse12 (not (= ~IPC~0 2))) (.cse13 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse14 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (< 0 (+ .cse19 2))) (.cse17 (<= 4 ~SKIP2~0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse16 .cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse18) (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse16 .cse17 .cse18))))) [2021-10-24 10:08:32,065 INFO L853 garLoopResultBuilder]: At program point L1628-23(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,065 INFO L853 garLoopResultBuilder]: At program point L1628-25(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-24 10:08:32,065 INFO L853 garLoopResultBuilder]: At program point L1628-26(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,065 INFO L853 garLoopResultBuilder]: At program point L1628-28(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,066 INFO L853 garLoopResultBuilder]: At program point L1628-30(lines 1 1630) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~IPC~0 2)) (= ~IPC~0 ~s~0) .cse5) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) .cse5 (= ~SKIP2~0 ~s~0)))) [2021-10-24 10:08:32,066 INFO L853 garLoopResultBuilder]: At program point L1628-32(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,066 INFO L853 garLoopResultBuilder]: At program point L1628-34(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-24 10:08:32,066 INFO L853 garLoopResultBuilder]: At program point L1628-38(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-24 10:08:32,067 INFO L853 garLoopResultBuilder]: At program point L1628-41(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,067 INFO L853 garLoopResultBuilder]: At program point L1628-43(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-24 10:08:32,067 INFO L853 garLoopResultBuilder]: At program point L1628-44(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,067 INFO L853 garLoopResultBuilder]: At program point L1628-46(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-24 10:08:32,067 INFO L853 garLoopResultBuilder]: At program point L1628-47(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,068 INFO L853 garLoopResultBuilder]: At program point L1628-49(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-24 10:08:32,068 INFO L860 garLoopResultBuilder]: At program point L837(lines 667 839) the Hoare annotation is: true [2021-10-24 10:08:32,068 INFO L853 garLoopResultBuilder]: At program point L707(lines 701 838) the Hoare annotation is: (let ((.cse18 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse20 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= 4 ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= 7 ~IPC~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse7 (= 2 ~DC~0)) (.cse21 (= ~pended~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse23 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (= ~pended~0 0)) (.cse22 (= ~compRegistered~0 0))) (or (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse6 .cse1 .cse7 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse5 .cse13 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse7 .cse17 .cse18 .cse19 .cse5) (and .cse15 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 (or .cse20 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse11 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse19 .cse5) (and .cse0 .cse1 .cse7 .cse21 .cse4 .cse18 .cse22) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse22) (and .cse14 .cse15 .cse16 .cse1 .cse7 .cse17 .cse11 .cse19 .cse12 .cse5 .cse13) (and .cse23 .cse0 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5) (and .cse6 .cse15 .cse0 .cse20 .cse1 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8 .cse3 .cse9 .cse4 .cse10 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse19 .cse12 .cse5) (and .cse0 .cse7 .cse21 .cse4 (= ~s~0 ~NP~0) .cse22) (and .cse14 .cse15 .cse0 .cse1 .cse7 .cse21 .cse11 .cse19 .cse22 .cse13) (and .cse23 .cse0 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4 .cse5) (and .cse2 (= ULTIMATE.start_main_~status~1 0) .cse5 .cse22))) [2021-10-24 10:08:32,068 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,068 INFO L857 garLoopResultBuilder]: For program point L1369(lines 1369 1536) no Hoare annotation was computed. [2021-10-24 10:08:32,069 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,069 INFO L853 garLoopResultBuilder]: At program point L974(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,069 INFO L853 garLoopResultBuilder]: At program point L974-1(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,069 INFO L853 garLoopResultBuilder]: At program point L974-2(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,069 INFO L853 garLoopResultBuilder]: At program point L974-3(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,070 INFO L853 garLoopResultBuilder]: At program point L974-4(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-24 10:08:32,070 INFO L853 garLoopResultBuilder]: At program point L974-5(lines 974 986) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-24 10:08:32,070 INFO L853 garLoopResultBuilder]: At program point L974-6(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-24 10:08:32,070 INFO L853 garLoopResultBuilder]: At program point L974-7(lines 974 986) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-24 10:08:32,071 INFO L853 garLoopResultBuilder]: At program point L974-8(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,071 INFO L853 garLoopResultBuilder]: At program point L974-9(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,071 INFO L853 garLoopResultBuilder]: At program point L974-10(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,071 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,071 INFO L853 garLoopResultBuilder]: At program point L974-11(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,072 INFO L853 garLoopResultBuilder]: At program point L974-12(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,072 INFO L853 garLoopResultBuilder]: At program point L974-13(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,072 INFO L853 garLoopResultBuilder]: At program point L974-14(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-24 10:08:32,072 INFO L853 garLoopResultBuilder]: At program point L974-15(lines 974 986) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-24 10:08:32,072 INFO L853 garLoopResultBuilder]: At program point L974-16(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,073 INFO L853 garLoopResultBuilder]: At program point L974-17(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,073 INFO L853 garLoopResultBuilder]: At program point L974-18(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,073 INFO L853 garLoopResultBuilder]: At program point L974-19(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,073 INFO L853 garLoopResultBuilder]: At program point L974-20(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,073 INFO L853 garLoopResultBuilder]: At program point L974-21(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point L1376(lines 1376 1534) no Hoare annotation was computed. [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 331) no Hoare annotation was computed. [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point L980(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point L980-2(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,074 INFO L857 garLoopResultBuilder]: For program point L980-4(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-6(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-8(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-10(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-12(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-14(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-16(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,075 INFO L857 garLoopResultBuilder]: For program point L980-18(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,076 INFO L857 garLoopResultBuilder]: For program point L980-20(lines 980 984) no Hoare annotation was computed. [2021-10-24 10:08:32,076 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-24 10:08:32,076 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 330) no Hoare annotation was computed. [2021-10-24 10:08:32,076 INFO L853 garLoopResultBuilder]: At program point L324-1(lines 1 1630) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-24 10:08:32,076 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,076 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,076 INFO L857 garLoopResultBuilder]: For program point L1383(lines 1383 1532) no Hoare annotation was computed. [2021-10-24 10:08:32,077 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,077 INFO L853 garLoopResultBuilder]: At program point L1384(lines 1376 1534) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,077 INFO L857 garLoopResultBuilder]: For program point L198(lines 198 206) no Hoare annotation was computed. [2021-10-24 10:08:32,077 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,077 INFO L853 garLoopResultBuilder]: At program point L730(lines 730 778) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,078 INFO L853 garLoopResultBuilder]: At program point L1526(lines 1401 1527) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~s~0 ~NP~0)) (.cse5 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~pended~0 0)) (.cse4 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= ~IPC~0 2)) .cse3 .cse4) (and .cse1 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse2 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse3 (<= (+ 2 ~NP~0) ~SKIP1~0) .cse5 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259)) .cse6 (<= 4 ~SKIP2~0) .cse7 .cse4) (and (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= (+ ~NP~0 4) ~MPR1~0) .cse7 .cse4 (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 0)))) [2021-10-24 10:08:32,078 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,078 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,078 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,078 INFO L853 garLoopResultBuilder]: At program point L735(lines 735 777) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,078 INFO L853 garLoopResultBuilder]: At program point L207(lines 207 426) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,079 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,079 INFO L857 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2021-10-24 10:08:32,079 INFO L857 garLoopResultBuilder]: For program point L340-2(lines 340 345) no Hoare annotation was computed. [2021-10-24 10:08:32,079 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,079 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 425) no Hoare annotation was computed. [2021-10-24 10:08:32,079 INFO L853 garLoopResultBuilder]: At program point L1400(lines 1390 1530) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,079 INFO L853 garLoopResultBuilder]: At program point L740(lines 740 776) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,080 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 424) no Hoare annotation was computed. [2021-10-24 10:08:32,080 INFO L853 garLoopResultBuilder]: At program point L214(lines 210 425) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,080 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 423) no Hoare annotation was computed. [2021-10-24 10:08:32,080 INFO L853 garLoopResultBuilder]: At program point L1009(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,080 INFO L853 garLoopResultBuilder]: At program point L1009-1(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,081 INFO L853 garLoopResultBuilder]: At program point L1009-2(lines 973 1037) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-24 10:08:32,081 INFO L853 garLoopResultBuilder]: At program point L1009-3(lines 973 1037) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-24 10:08:32,081 INFO L853 garLoopResultBuilder]: At program point L1009-4(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,081 INFO L853 garLoopResultBuilder]: At program point L1009-5(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,081 INFO L853 garLoopResultBuilder]: At program point L1009-6(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,082 INFO L853 garLoopResultBuilder]: At program point L1009-7(lines 973 1037) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-24 10:08:32,082 INFO L853 garLoopResultBuilder]: At program point L745(lines 745 775) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,082 INFO L853 garLoopResultBuilder]: At program point L1009-8(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,082 INFO L853 garLoopResultBuilder]: At program point L1009-9(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,082 INFO L853 garLoopResultBuilder]: At program point L1009-10(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,083 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,083 INFO L853 garLoopResultBuilder]: At program point L85(lines 707 779) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (not (= 2 ~s~0)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,083 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,083 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-24 10:08:32,083 INFO L857 garLoopResultBuilder]: For program point L1275(lines 1275 1287) no Hoare annotation was computed. [2021-10-24 10:08:32,083 INFO L857 garLoopResultBuilder]: For program point L1275-2(lines 1274 1563) no Hoare annotation was computed. [2021-10-24 10:08:32,084 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,084 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 422) no Hoare annotation was computed. [2021-10-24 10:08:32,084 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,084 INFO L853 garLoopResultBuilder]: At program point L220(lines 216 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,084 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,084 INFO L853 garLoopResultBuilder]: At program point L222(lines 222 421) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1280(lines 1280 1285) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017-1(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017-2(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017-3(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017-4(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017-5(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,085 INFO L857 garLoopResultBuilder]: For program point L1017-6(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,086 INFO L857 garLoopResultBuilder]: For program point L1017-7(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,086 INFO L857 garLoopResultBuilder]: For program point L1017-8(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,086 INFO L857 garLoopResultBuilder]: For program point L1017-9(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,086 INFO L857 garLoopResultBuilder]: For program point L1017-10(lines 1017 1034) no Hoare annotation was computed. [2021-10-24 10:08:32,086 INFO L853 garLoopResultBuilder]: At program point L225(lines 225 420) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,086 INFO L857 garLoopResultBuilder]: For program point L491(lines 491 503) no Hoare annotation was computed. [2021-10-24 10:08:32,086 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 366) no Hoare annotation was computed. [2021-10-24 10:08:32,087 INFO L853 garLoopResultBuilder]: At program point L228(lines 227 420) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-24 10:08:32,087 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,087 INFO L857 garLoopResultBuilder]: For program point L627(lines 627 629) no Hoare annotation was computed. [2021-10-24 10:08:32,087 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,087 INFO L857 garLoopResultBuilder]: For program point L496(lines 496 502) no Hoare annotation was computed. [2021-10-24 10:08:32,087 INFO L853 garLoopResultBuilder]: At program point L496-1(lines 1 1630) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-24 10:08:32,088 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,088 INFO L857 garLoopResultBuilder]: For program point L1554(lines 1554 1560) no Hoare annotation was computed. [2021-10-24 10:08:32,088 INFO L853 garLoopResultBuilder]: At program point L1554-1(lines 1554 1560) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse5 (not (= ~IPC~0 2))) (.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= 2 ~s~0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 2 ~DC~0) .cse2 .cse3 .cse5 (= ~s~0 ~NP~0) .cse6) (and (<= 7 ~IPC~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 (<= (+ 5 ~NP~0) ~MPR3~0) .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~pended~0 0) .cse6))) [2021-10-24 10:08:32,088 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-24 10:08:32,088 INFO L857 garLoopResultBuilder]: For program point L1026(lines 1026 1033) no Hoare annotation was computed. [2021-10-24 10:08:32,093 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:08:32,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:08:32 BoogieIcfgContainer [2021-10-24 10:08:32,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:08:32,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:08:32,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:08:32,177 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:08:32,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:08:09" (3/4) ... [2021-10-24 10:08:32,180 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-24 10:08:32,219 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 278 nodes and edges [2021-10-24 10:08:32,224 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 89 nodes and edges [2021-10-24 10:08:32,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-24 10:08:32,235 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-24 10:08:32,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-24 10:08:32,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-24 10:08:32,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 == s) && !(MPR3 == s))) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && !(MPR3 == s))) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0)) || ((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2))) || ((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) [2021-10-24 10:08:32,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || (((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2))) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && !(2 == s)) && lowerDriverReturn == status) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || ((((((((((returnVal2 <= lowerDriverReturn && status <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2)) || (((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258))) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && lowerDriverReturn <= status)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-24 10:08:32,268 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || ((((((((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2) && pended == 0)) || (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) [2021-10-24 10:08:32,282 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) [2021-10-24 10:08:32,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) || (((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && !(ntStatus == 259)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) && ntStatus <= 0) [2021-10-24 10:08:32,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || (((((((((\result + 1073741536 <= 0 && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) [2021-10-24 10:08:32,303 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) [2021-10-24 10:08:32,304 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && status <= 258) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && status <= 258) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-24 10:08:32,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 [2021-10-24 10:08:32,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 [2021-10-24 10:08:32,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-24 10:08:32,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-24 10:08:32,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 10:08:32,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:08:32,565 INFO L168 Benchmark]: Toolchain (without parser) took 26453.46 ms. Allocated memory was 94.4 MB in the beginning and 352.3 MB in the end (delta: 257.9 MB). Free memory was 57.9 MB in the beginning and 290.1 MB in the end (delta: -232.2 MB). Peak memory consumption was 217.6 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,565 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 94.4 MB. Free memory was 63.8 MB in the beginning and 63.7 MB in the end (delta: 31.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:08:32,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.78 ms. Allocated memory is still 94.4 MB. Free memory was 57.8 MB in the beginning and 54.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.64 ms. Allocated memory is still 94.4 MB. Free memory was 54.8 MB in the beginning and 44.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,566 INFO L168 Benchmark]: Boogie Preprocessor took 121.37 ms. Allocated memory was 94.4 MB in the beginning and 123.7 MB in the end (delta: 29.4 MB). Free memory was 44.0 MB in the beginning and 93.8 MB in the end (delta: -49.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,567 INFO L168 Benchmark]: RCFGBuilder took 2800.59 ms. Allocated memory was 123.7 MB in the beginning and 159.4 MB in the end (delta: 35.7 MB). Free memory was 93.7 MB in the beginning and 114.3 MB in the end (delta: -20.6 MB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,567 INFO L168 Benchmark]: TraceAbstraction took 22319.30 ms. Allocated memory was 159.4 MB in the beginning and 352.3 MB in the end (delta: 192.9 MB). Free memory was 114.3 MB in the beginning and 139.5 MB in the end (delta: -25.1 MB). Peak memory consumption was 209.8 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,567 INFO L168 Benchmark]: Witness Printer took 386.58 ms. Allocated memory is still 352.3 MB. Free memory was 139.5 MB in the beginning and 290.1 MB in the end (delta: -150.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-24 10:08:32,570 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.22 ms. Allocated memory is still 94.4 MB. Free memory was 63.8 MB in the beginning and 63.7 MB in the end (delta: 31.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 678.78 ms. Allocated memory is still 94.4 MB. Free memory was 57.8 MB in the beginning and 54.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 140.64 ms. Allocated memory is still 94.4 MB. Free memory was 54.8 MB in the beginning and 44.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.37 ms. Allocated memory was 94.4 MB in the beginning and 123.7 MB in the end (delta: 29.4 MB). Free memory was 44.0 MB in the beginning and 93.8 MB in the end (delta: -49.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2800.59 ms. Allocated memory was 123.7 MB in the beginning and 159.4 MB in the end (delta: 35.7 MB). Free memory was 93.7 MB in the beginning and 114.3 MB in the end (delta: -20.6 MB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22319.30 ms. Allocated memory was 159.4 MB in the beginning and 352.3 MB in the end (delta: 192.9 MB). Free memory was 114.3 MB in the beginning and 139.5 MB in the end (delta: -25.1 MB). Peak memory consumption was 209.8 MB. Max. memory is 16.1 GB. * Witness Printer took 386.58 ms. Allocated memory is still 352.3 MB. Free memory was 139.5 MB in the beginning and 290.1 MB in the end (delta: -150.7 MB). Peak memory consumption was 41.9 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: 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, 351 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 22160.6ms, OverallIterations: 48, TraceHistogramMax: 1, EmptinessCheckTime: 57.6ms, AutomataDifference: 5996.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 11407.4ms, InitialAbstractionConstructionTime: 23.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11730 SDtfs, 7663 SDslu, 14234 SDs, 0 SdLazy, 3717 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2704.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1067.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=3, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1224.2ms AutomataMinimizationTime, 48 MinimizatonAttempts, 658 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 348 NumberOfFragments, 8598 HoareAnnotationTreeSize, 114 FomulaSimplifications, 2854397 FormulaSimplificationTreeSizeReduction, 1736.4ms HoareSimplificationTime, 114 FomulaSimplificationsInter, 515337 FormulaSimplificationTreeSizeReductionInter, 9637.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 154.0ms SsaConstructionTime, 685.5ms SatisfiabilityAnalysisTime, 1963.4ms InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1259 ConstructedInterpolants, 0 QuantifiedInterpolants, 3493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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 53 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 == s) && !(MPR3 == s))) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && !(MPR3 == s))) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0)) || ((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2))) || ((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1321]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((returnVal2 <= lowerDriverReturn && lowerDriverReturn <= ntStatus) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && ntStatus <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || (((((((((5 + NP <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && status == 0) && 2 == s) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= ntStatus) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && ntStatus <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && (259 == __cil_tmp30 || ntStatus <= 258)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1401]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) || (((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && !(ntStatus == 259)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) && ntStatus <= 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: ((((((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && !(2 == s)) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 2 + s <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 724]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) || ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 740]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((s == DC && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1390]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || (((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2))) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && !(2 == s)) && lowerDriverReturn == status) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || ((((((((((returnVal2 <= lowerDriverReturn && status <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2)) || (((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258))) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && lowerDriverReturn <= status)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((s == DC && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: ((((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || (((((((((\result + 1073741536 <= 0 && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && status <= 258) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && status <= 258) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1554]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1376]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 735]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || ((((((((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2) && pended == 0)) || (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && (ntStatus <= 258 || 259 == __cil_tmp11)) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: ((((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-10-24 10:08:32,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f2f349-7c7f-410e-8ce8-f36f65042f09/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...