./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:50:11,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:50:11,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:50:11,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:50:11,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:50:11,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:50:11,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:50:11,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:50:11,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:50:11,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:50:11,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:50:11,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:50:11,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:50:11,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:50:11,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:50:11,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:50:11,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:50:11,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:50:11,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:50:11,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:50:11,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:50:11,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:50:11,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:50:11,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:50:11,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:50:11,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:50:11,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:50:11,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:50:11,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:50:11,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:50:11,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:50:11,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:50:11,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:50:11,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:50:11,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:50:11,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:50:11,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:50:11,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:50:11,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:50:11,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:50:11,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:50:11,880 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 04:50:11,912 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:50:11,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:50:11,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:50:11,914 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:50:11,914 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:50:11,914 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:50:11,915 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:50:11,915 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:50:11,915 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:50:11,915 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:50:11,916 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:50:11,916 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:50:11,916 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:50:11,917 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:50:11,917 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:50:11,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:50:11,918 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:50:11,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:50:11,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:50:11,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:50:11,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:50:11,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:50:11,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:50:11,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:50:11,920 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:50:11,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:50:11,921 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:50:11,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:50:11,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:50:11,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:50:11,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:11,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:50:11,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:50:11,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:50:11,923 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:50:11,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:50:11,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:50:11,924 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:50:11,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:50:11,925 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_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2021-10-29 04:50:12,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:50:12,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:50:12,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:50:12,289 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:50:12,290 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:50:12,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-29 04:50:12,381 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/data/3c0f4457b/8cf10194ec31478d8550b5ac856adbec/FLAGf6bb7acb3 [2021-10-29 04:50:13,256 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:50:13,257 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-29 04:50:13,271 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/data/3c0f4457b/8cf10194ec31478d8550b5ac856adbec/FLAGf6bb7acb3 [2021-10-29 04:50:13,463 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/data/3c0f4457b/8cf10194ec31478d8550b5ac856adbec [2021-10-29 04:50:13,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:50:13,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:50:13,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:13,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:50:13,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:50:13,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:13" (1/1) ... [2021-10-29 04:50:13,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c74499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:13, skipping insertion in model container [2021-10-29 04:50:13,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:13" (1/1) ... [2021-10-29 04:50:13,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:50:13,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:50:13,824 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_d3d03305-2704-4777-9a7e-eb2feaacbee2/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-29 04:50:13,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:13,967 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:50:13,988 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_d3d03305-2704-4777-9a7e-eb2feaacbee2/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-29 04:50:14,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:14,120 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:50:14,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14 WrapperNode [2021-10-29 04:50:14,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:14,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:14,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:50:14,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:50:14,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:14,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:50:14,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:50:14,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:50:14,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:50:14,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:50:14,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:50:14,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:50:14,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,468 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:14,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:50:14,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:50:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:50:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:50:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:50:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:50:14,900 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,910 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,920 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,925 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,927 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,931 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,935 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,939 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,941 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,942 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,947 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,973 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,975 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,975 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,978 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,981 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:14,987 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,003 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,005 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,008 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,012 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,013 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,014 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:15,017 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:50:16,386 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-10-29 04:50:16,386 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-10-29 04:50:16,386 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-10-29 04:50:16,387 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-10-29 04:50:16,387 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-10-29 04:50:16,387 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-10-29 04:50:16,387 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-10-29 04:50:16,387 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-10-29 04:50:16,388 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-10-29 04:50:16,388 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-10-29 04:50:16,388 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-10-29 04:50:16,388 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-29 04:50:16,389 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-29 04:50:16,389 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-10-29 04:50:16,389 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-10-29 04:50:16,389 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-10-29 04:50:16,390 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-10-29 04:50:16,390 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-10-29 04:50:16,390 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-10-29 04:50:16,390 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-10-29 04:50:16,391 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-10-29 04:50:16,391 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-10-29 04:50:16,391 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-29 04:50:16,391 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-29 04:50:16,391 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-10-29 04:50:16,392 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-10-29 04:50:16,392 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-10-29 04:50:16,392 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-10-29 04:50:16,392 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-10-29 04:50:16,393 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-10-29 04:50:16,395 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-10-29 04:50:16,396 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-10-29 04:50:16,396 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-10-29 04:50:16,396 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-10-29 04:50:16,396 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-10-29 04:50:16,397 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-10-29 04:50:16,397 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-10-29 04:50:16,397 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-29 04:50:16,397 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-10-29 04:50:16,398 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-29 04:50:16,398 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-10-29 04:50:16,398 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-10-29 04:50:16,400 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-10-29 04:50:16,400 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-10-29 04:50:16,400 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-10-29 04:50:16,400 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-10-29 04:50:16,401 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-10-29 04:50:16,401 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-10-29 04:50:17,635 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:50:17,635 INFO L299 CfgBuilder]: Removed 205 assume(true) statements. [2021-10-29 04:50:17,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:17 BoogieIcfgContainer [2021-10-29 04:50:17,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:50:17,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:50:17,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:50:17,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:50:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:50:13" (1/3) ... [2021-10-29 04:50:17,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b42daa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:17, skipping insertion in model container [2021-10-29 04:50:17,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14" (2/3) ... [2021-10-29 04:50:17,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b42daa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:17, skipping insertion in model container [2021-10-29 04:50:17,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:17" (3/3) ... [2021-10-29 04:50:17,656 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-10-29 04:50:17,664 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:50:17,664 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2021-10-29 04:50:17,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:50:17,763 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:50:17,764 INFO L340 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-10-29 04:50:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 214 states have (on average 1.7757009345794392) internal successors, (380), 254 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 04:50:17,799 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:17,800 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:17,801 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 119908539, now seen corresponding path program 1 times [2021-10-29 04:50:17,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:17,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365540767] [2021-10-29 04:50:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:17,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:18,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-29 04:50:18,097 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:18,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365540767] [2021-10-29 04:50:18,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365540767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:18,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:18,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:18,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372917078] [2021-10-29 04:50:18,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:18,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:18,152 INFO L87 Difference]: Start difference. First operand has 255 states, 214 states have (on average 1.7757009345794392) internal successors, (380), 254 states have internal predecessors, (380), 0 states have call successors, (0), 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.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:18,550 INFO L93 Difference]: Finished difference Result 480 states and 716 transitions. [2021-10-29 04:50:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-29 04:50:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:18,589 INFO L225 Difference]: With dead ends: 480 [2021-10-29 04:50:18,589 INFO L226 Difference]: Without dead ends: 256 [2021-10-29 04:50:18,596 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-29 04:50:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-29 04:50:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.4912280701754386) internal successors, (340), 255 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 340 transitions. [2021-10-29 04:50:18,701 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 340 transitions. Word has length 7 [2021-10-29 04:50:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:18,701 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 340 transitions. [2021-10-29 04:50:18,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2021-10-29 04:50:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:50:18,703 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:18,703 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:18,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:50:18,704 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -672701586, now seen corresponding path program 1 times [2021-10-29 04:50:18,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:18,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450832315] [2021-10-29 04:50:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:18,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:18,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-29 04:50:18,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:18,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450832315] [2021-10-29 04:50:18,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450832315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:18,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:18,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:18,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609359387] [2021-10-29 04:50:18,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:18,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:18,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:18,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:18,804 INFO L87 Difference]: Start difference. First operand 256 states and 340 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:18,881 INFO L93 Difference]: Finished difference Result 472 states and 620 transitions. [2021-10-29 04:50:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-10-29 04:50:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:18,887 INFO L225 Difference]: With dead ends: 472 [2021-10-29 04:50:18,887 INFO L226 Difference]: Without dead ends: 330 [2021-10-29 04:50:18,892 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-29 04:50:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2021-10-29 04:50:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 243 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2021-10-29 04:50:18,941 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 9 [2021-10-29 04:50:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:18,942 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2021-10-29 04:50:18,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2021-10-29 04:50:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 04:50:18,943 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:18,943 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:18,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:50:18,944 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1551307607, now seen corresponding path program 1 times [2021-10-29 04:50:18,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:18,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7149470] [2021-10-29 04:50:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:18,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:19,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-29 04:50:19,016 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:19,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7149470] [2021-10-29 04:50:19,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7149470] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:19,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:19,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:50:19,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14745565] [2021-10-29 04:50:19,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:19,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:19,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,020 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:19,044 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2021-10-29 04:50:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 04:50:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:19,053 INFO L225 Difference]: With dead ends: 263 [2021-10-29 04:50:19,053 INFO L226 Difference]: Without dead ends: 244 [2021-10-29 04:50:19,054 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-29 04:50:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-10-29 04:50:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 224 states have (on average 1.4375) internal successors, (322), 243 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2021-10-29 04:50:19,079 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 10 [2021-10-29 04:50:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:19,079 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2021-10-29 04:50:19,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2021-10-29 04:50:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:50:19,081 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:19,081 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:19,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:50:19,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1935314780, now seen corresponding path program 1 times [2021-10-29 04:50:19,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:19,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690376206] [2021-10-29 04:50:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:19,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:19,195 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:19,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690376206] [2021-10-29 04:50:19,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690376206] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:19,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:19,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:19,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170379122] [2021-10-29 04:50:19,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:19,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:19,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,199 INFO L87 Difference]: Start difference. First operand 244 states and 322 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:19,235 INFO L93 Difference]: Finished difference Result 301 states and 390 transitions. [2021-10-29 04:50:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:19,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-29 04:50:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:19,239 INFO L225 Difference]: With dead ends: 301 [2021-10-29 04:50:19,239 INFO L226 Difference]: Without dead ends: 281 [2021-10-29 04:50:19,240 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-29 04:50:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2021-10-29 04:50:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 243 states have (on average 1.4320987654320987) internal successors, (348), 261 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 348 transitions. [2021-10-29 04:50:19,259 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 348 transitions. Word has length 13 [2021-10-29 04:50:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:19,260 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 348 transitions. [2021-10-29 04:50:19,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2021-10-29 04:50:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 04:50:19,263 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:19,263 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:19,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:50:19,264 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash -684354150, now seen corresponding path program 1 times [2021-10-29 04:50:19,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:19,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324815931] [2021-10-29 04:50:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:19,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:19,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:19,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324815931] [2021-10-29 04:50:19,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324815931] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:19,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:19,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:50:19,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328151253] [2021-10-29 04:50:19,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:19,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:19,392 INFO L87 Difference]: Start difference. First operand 262 states and 348 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:19,439 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2021-10-29 04:50:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:50:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-29 04:50:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:19,443 INFO L225 Difference]: With dead ends: 325 [2021-10-29 04:50:19,443 INFO L226 Difference]: Without dead ends: 289 [2021-10-29 04:50:19,444 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-29 04:50:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 249. [2021-10-29 04:50:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 1.4217391304347826) internal successors, (327), 248 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 327 transitions. [2021-10-29 04:50:19,466 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 327 transitions. Word has length 16 [2021-10-29 04:50:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:19,466 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 327 transitions. [2021-10-29 04:50:19,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 327 transitions. [2021-10-29 04:50:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 04:50:19,473 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:19,474 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:19,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:50:19,475 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1690048014, now seen corresponding path program 1 times [2021-10-29 04:50:19,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:19,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438837630] [2021-10-29 04:50:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:19,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:19,560 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:19,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438837630] [2021-10-29 04:50:19,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438837630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:19,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:19,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:19,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409900657] [2021-10-29 04:50:19,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:19,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,566 INFO L87 Difference]: Start difference. First operand 249 states and 327 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:19,778 INFO L93 Difference]: Finished difference Result 271 states and 353 transitions. [2021-10-29 04:50:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:19,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-29 04:50:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:19,781 INFO L225 Difference]: With dead ends: 271 [2021-10-29 04:50:19,782 INFO L226 Difference]: Without dead ends: 266 [2021-10-29 04:50:19,782 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-29 04:50:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-29 04:50:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 247 states have (on average 1.408906882591093) internal successors, (348), 265 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 348 transitions. [2021-10-29 04:50:19,805 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 348 transitions. Word has length 16 [2021-10-29 04:50:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:19,805 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 348 transitions. [2021-10-29 04:50:19,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 348 transitions. [2021-10-29 04:50:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 04:50:19,810 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:19,810 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:19,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:50:19,811 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1122523632, now seen corresponding path program 1 times [2021-10-29 04:50:19,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:19,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566606359] [2021-10-29 04:50:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:19,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:19,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:19,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566606359] [2021-10-29 04:50:19,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566606359] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:19,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:19,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:19,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049906269] [2021-10-29 04:50:19,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:19,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:19,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:19,918 INFO L87 Difference]: Start difference. First operand 266 states and 348 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:20,074 INFO L93 Difference]: Finished difference Result 266 states and 348 transitions. [2021-10-29 04:50:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:20,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 04:50:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:20,085 INFO L225 Difference]: With dead ends: 266 [2021-10-29 04:50:20,086 INFO L226 Difference]: Without dead ends: 254 [2021-10-29 04:50:20,087 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-29 04:50:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-10-29 04:50:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 253 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 336 transitions. [2021-10-29 04:50:20,129 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 336 transitions. Word has length 17 [2021-10-29 04:50:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:20,130 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 336 transitions. [2021-10-29 04:50:20,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 336 transitions. [2021-10-29 04:50:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 04:50:20,131 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:20,131 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:20,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:50:20,132 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -984746365, now seen corresponding path program 1 times [2021-10-29 04:50:20,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:20,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465343704] [2021-10-29 04:50:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:20,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:20,225 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:20,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465343704] [2021-10-29 04:50:20,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465343704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:20,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:20,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:20,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512448740] [2021-10-29 04:50:20,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:20,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:20,228 INFO L87 Difference]: Start difference. First operand 254 states and 336 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:20,375 INFO L93 Difference]: Finished difference Result 354 states and 469 transitions. [2021-10-29 04:50:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 04:50:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:20,378 INFO L225 Difference]: With dead ends: 354 [2021-10-29 04:50:20,378 INFO L226 Difference]: Without dead ends: 251 [2021-10-29 04:50:20,379 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-29 04:50:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-29 04:50:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.3833333333333333) internal successors, (332), 250 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2021-10-29 04:50:20,398 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 17 [2021-10-29 04:50:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:20,398 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2021-10-29 04:50:20,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2021-10-29 04:50:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 04:50:20,400 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:20,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:20,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:50:20,401 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -834424813, now seen corresponding path program 1 times [2021-10-29 04:50:20,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:20,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260622798] [2021-10-29 04:50:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:20,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:20,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:20,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260622798] [2021-10-29 04:50:20,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260622798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:20,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:20,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:20,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244658874] [2021-10-29 04:50:20,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:20,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:20,497 INFO L87 Difference]: Start difference. First operand 251 states and 332 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:20,674 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2021-10-29 04:50:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 04:50:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:20,678 INFO L225 Difference]: With dead ends: 256 [2021-10-29 04:50:20,678 INFO L226 Difference]: Without dead ends: 251 [2021-10-29 04:50:20,679 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-29 04:50:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-29 04:50:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.3791666666666667) internal successors, (331), 250 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2021-10-29 04:50:20,704 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 17 [2021-10-29 04:50:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:20,704 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2021-10-29 04:50:20,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2021-10-29 04:50:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 04:50:20,706 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:20,706 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:20,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:50:20,707 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash -590061255, now seen corresponding path program 1 times [2021-10-29 04:50:20,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:20,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720904400] [2021-10-29 04:50:20,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:20,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:20,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:20,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720904400] [2021-10-29 04:50:20,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720904400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:20,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:20,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:20,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739140297] [2021-10-29 04:50:20,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:20,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:20,784 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:20,850 INFO L93 Difference]: Finished difference Result 344 states and 443 transitions. [2021-10-29 04:50:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:20,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-29 04:50:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:20,853 INFO L225 Difference]: With dead ends: 344 [2021-10-29 04:50:20,854 INFO L226 Difference]: Without dead ends: 249 [2021-10-29 04:50:20,854 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-29 04:50:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 235. [2021-10-29 04:50:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 224 states have (on average 1.3571428571428572) internal successors, (304), 234 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 304 transitions. [2021-10-29 04:50:20,877 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 304 transitions. Word has length 18 [2021-10-29 04:50:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:20,878 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 304 transitions. [2021-10-29 04:50:20,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 304 transitions. [2021-10-29 04:50:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 04:50:20,879 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:20,879 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:20,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 04:50:20,880 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -626633759, now seen corresponding path program 1 times [2021-10-29 04:50:20,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:20,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343379222] [2021-10-29 04:50:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:20,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:20,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:20,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343379222] [2021-10-29 04:50:20,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343379222] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:20,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:20,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:20,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240224600] [2021-10-29 04:50:20,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:20,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:20,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:20,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:20,990 INFO L87 Difference]: Start difference. First operand 235 states and 304 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:21,189 INFO L93 Difference]: Finished difference Result 240 states and 308 transitions. [2021-10-29 04:50:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-29 04:50:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:21,194 INFO L225 Difference]: With dead ends: 240 [2021-10-29 04:50:21,194 INFO L226 Difference]: Without dead ends: 235 [2021-10-29 04:50:21,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-29 04:50:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-10-29 04:50:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 234 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 303 transitions. [2021-10-29 04:50:21,224 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 303 transitions. Word has length 18 [2021-10-29 04:50:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:21,225 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 303 transitions. [2021-10-29 04:50:21,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 303 transitions. [2021-10-29 04:50:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 04:50:21,226 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:21,227 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:21,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:50:21,227 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 964254453, now seen corresponding path program 1 times [2021-10-29 04:50:21,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:21,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932356489] [2021-10-29 04:50:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:21,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:21,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:21,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932356489] [2021-10-29 04:50:21,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932356489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:21,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:21,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:21,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879907921] [2021-10-29 04:50:21,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:21,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:21,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:21,272 INFO L87 Difference]: Start difference. First operand 235 states and 303 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:21,449 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2021-10-29 04:50:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:21,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 04:50:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:21,452 INFO L225 Difference]: With dead ends: 306 [2021-10-29 04:50:21,452 INFO L226 Difference]: Without dead ends: 298 [2021-10-29 04:50:21,453 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-29 04:50:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 243. [2021-10-29 04:50:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 232 states have (on average 1.3577586206896552) internal successors, (315), 242 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 315 transitions. [2021-10-29 04:50:21,479 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 315 transitions. Word has length 19 [2021-10-29 04:50:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:21,481 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 315 transitions. [2021-10-29 04:50:21,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 315 transitions. [2021-10-29 04:50:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 04:50:21,483 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:21,483 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:21,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:50:21,483 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1688925962, now seen corresponding path program 1 times [2021-10-29 04:50:21,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:21,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030690201] [2021-10-29 04:50:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:21,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:21,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:21,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030690201] [2021-10-29 04:50:21,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030690201] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:21,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:21,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:50:21,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036205016] [2021-10-29 04:50:21,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:21,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:21,537 INFO L87 Difference]: Start difference. First operand 243 states and 315 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-29 04:50:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:21,588 INFO L93 Difference]: Finished difference Result 256 states and 327 transitions. [2021-10-29 04:50:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:21,589 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-29 04:50:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:21,591 INFO L225 Difference]: With dead ends: 256 [2021-10-29 04:50:21,591 INFO L226 Difference]: Without dead ends: 241 [2021-10-29 04:50:21,592 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-29 04:50:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-10-29 04:50:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 230 states have (on average 1.3565217391304347) internal successors, (312), 240 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 312 transitions. [2021-10-29 04:50:21,615 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 312 transitions. Word has length 19 [2021-10-29 04:50:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:21,616 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 312 transitions. [2021-10-29 04:50:21,616 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-29 04:50:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 312 transitions. [2021-10-29 04:50:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 04:50:21,617 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:21,618 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:21,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 04:50:21,618 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash -180541531, now seen corresponding path program 1 times [2021-10-29 04:50:21,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:21,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884711632] [2021-10-29 04:50:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:21,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:21,711 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:21,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884711632] [2021-10-29 04:50:21,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884711632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:21,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:21,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:21,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474561170] [2021-10-29 04:50:21,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:21,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:21,714 INFO L87 Difference]: Start difference. First operand 241 states and 312 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-29 04:50:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:21,920 INFO L93 Difference]: Finished difference Result 273 states and 349 transitions. [2021-10-29 04:50:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:21,921 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-29 04:50:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:21,923 INFO L225 Difference]: With dead ends: 273 [2021-10-29 04:50:21,923 INFO L226 Difference]: Without dead ends: 236 [2021-10-29 04:50:21,924 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-29 04:50:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-10-29 04:50:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 226 states have (on average 1.345132743362832) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2021-10-29 04:50:21,951 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 20 [2021-10-29 04:50:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:21,952 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2021-10-29 04:50:21,952 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-29 04:50:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2021-10-29 04:50:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 04:50:21,954 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:21,954 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:21,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 04:50:21,954 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 217229373, now seen corresponding path program 1 times [2021-10-29 04:50:21,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:21,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965833231] [2021-10-29 04:50:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:21,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:22,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-29 04:50:22,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:22,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965833231] [2021-10-29 04:50:22,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965833231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:22,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:22,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:22,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610092373] [2021-10-29 04:50:22,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:22,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:22,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:22,005 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:22,066 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2021-10-29 04:50:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:22,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 04:50:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:22,069 INFO L225 Difference]: With dead ends: 353 [2021-10-29 04:50:22,070 INFO L226 Difference]: Without dead ends: 259 [2021-10-29 04:50:22,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-29 04:50:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 224. [2021-10-29 04:50:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.3179723502304148) internal successors, (286), 223 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 286 transitions. [2021-10-29 04:50:22,097 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 286 transitions. Word has length 20 [2021-10-29 04:50:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:22,098 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 286 transitions. [2021-10-29 04:50:22,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 286 transitions. [2021-10-29 04:50:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 04:50:22,099 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:22,100 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:22,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 04:50:22,100 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:22,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash -112139151, now seen corresponding path program 1 times [2021-10-29 04:50:22,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:22,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071257975] [2021-10-29 04:50:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:22,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:22,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:22,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071257975] [2021-10-29 04:50:22,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071257975] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:22,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:22,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:22,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351434058] [2021-10-29 04:50:22,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:22,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:22,252 INFO L87 Difference]: Start difference. First operand 224 states and 286 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-29 04:50:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:22,321 INFO L93 Difference]: Finished difference Result 324 states and 408 transitions. [2021-10-29 04:50:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:22,322 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-29 04:50:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:22,324 INFO L225 Difference]: With dead ends: 324 [2021-10-29 04:50:22,324 INFO L226 Difference]: Without dead ends: 226 [2021-10-29 04:50:22,325 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-29 04:50:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2021-10-29 04:50:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 211 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 268 transitions. [2021-10-29 04:50:22,356 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 268 transitions. Word has length 21 [2021-10-29 04:50:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:22,357 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 268 transitions. [2021-10-29 04:50:22,357 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-29 04:50:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2021-10-29 04:50:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:50:22,358 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:22,358 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:22,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 04:50:22,359 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash 135545772, now seen corresponding path program 1 times [2021-10-29 04:50:22,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:22,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078342255] [2021-10-29 04:50:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:22,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:22,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:22,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078342255] [2021-10-29 04:50:22,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078342255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:22,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:22,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:22,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875196526] [2021-10-29 04:50:22,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:22,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:22,435 INFO L87 Difference]: Start difference. First operand 212 states and 268 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:22,639 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2021-10-29 04:50:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 04:50:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:22,642 INFO L225 Difference]: With dead ends: 324 [2021-10-29 04:50:22,642 INFO L226 Difference]: Without dead ends: 238 [2021-10-29 04:50:22,644 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-29 04:50:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2021-10-29 04:50:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 211 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2021-10-29 04:50:22,677 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 22 [2021-10-29 04:50:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:22,678 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2021-10-29 04:50:22,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2021-10-29 04:50:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 04:50:22,679 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:22,679 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:22,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 04:50:22,679 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -458730667, now seen corresponding path program 1 times [2021-10-29 04:50:22,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:22,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808662818] [2021-10-29 04:50:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:22,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:22,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-29 04:50:22,764 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:22,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808662818] [2021-10-29 04:50:22,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808662818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:22,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:22,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:22,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008404672] [2021-10-29 04:50:22,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:22,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:22,768 INFO L87 Difference]: Start difference. First operand 212 states and 265 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:23,094 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2021-10-29 04:50:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:50:23,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 04:50:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:23,097 INFO L225 Difference]: With dead ends: 278 [2021-10-29 04:50:23,097 INFO L226 Difference]: Without dead ends: 274 [2021-10-29 04:50:23,097 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-10-29 04:50:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 212. [2021-10-29 04:50:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2864077669902914) internal successors, (265), 211 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 265 transitions. [2021-10-29 04:50:23,161 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 265 transitions. Word has length 23 [2021-10-29 04:50:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:23,161 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 265 transitions. [2021-10-29 04:50:23,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 265 transitions. [2021-10-29 04:50:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:50:23,163 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:23,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:23,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 04:50:23,164 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1186277304, now seen corresponding path program 1 times [2021-10-29 04:50:23,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:23,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418963863] [2021-10-29 04:50:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:23,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:23,224 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:23,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418963863] [2021-10-29 04:50:23,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418963863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:23,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:23,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:23,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271801228] [2021-10-29 04:50:23,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:23,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:23,227 INFO L87 Difference]: Start difference. First operand 212 states and 265 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:23,424 INFO L93 Difference]: Finished difference Result 271 states and 330 transitions. [2021-10-29 04:50:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:50:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:23,427 INFO L225 Difference]: With dead ends: 271 [2021-10-29 04:50:23,427 INFO L226 Difference]: Without dead ends: 238 [2021-10-29 04:50:23,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-29 04:50:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2021-10-29 04:50:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2572815533980584) internal successors, (259), 211 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 259 transitions. [2021-10-29 04:50:23,463 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 259 transitions. Word has length 24 [2021-10-29 04:50:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:23,463 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 259 transitions. [2021-10-29 04:50:23,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 259 transitions. [2021-10-29 04:50:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:50:23,464 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:23,465 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:23,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 04:50:23,465 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1566284008, now seen corresponding path program 1 times [2021-10-29 04:50:23,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:23,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864863408] [2021-10-29 04:50:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:23,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:23,508 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:23,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864863408] [2021-10-29 04:50:23,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864863408] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:23,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:23,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:23,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467357268] [2021-10-29 04:50:23,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:23,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:23,510 INFO L87 Difference]: Start difference. First operand 212 states and 259 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:23,664 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2021-10-29 04:50:23,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:23,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:50:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:23,666 INFO L225 Difference]: With dead ends: 245 [2021-10-29 04:50:23,666 INFO L226 Difference]: Without dead ends: 212 [2021-10-29 04:50:23,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-29 04:50:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-10-29 04:50:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2281553398058251) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-10-29 04:50:23,702 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 25 [2021-10-29 04:50:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:23,702 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-10-29 04:50:23,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-10-29 04:50:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:50:23,704 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:23,704 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:23,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 04:50:23,704 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1594212847, now seen corresponding path program 1 times [2021-10-29 04:50:23,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:23,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9356350] [2021-10-29 04:50:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:23,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:23,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:23,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9356350] [2021-10-29 04:50:23,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9356350] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:23,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:23,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:23,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229048546] [2021-10-29 04:50:23,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:23,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:23,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:23,793 INFO L87 Difference]: Start difference. First operand 212 states and 253 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-29 04:50:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:24,070 INFO L93 Difference]: Finished difference Result 232 states and 279 transitions. [2021-10-29 04:50:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:50:24,071 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-29 04:50:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:24,073 INFO L225 Difference]: With dead ends: 232 [2021-10-29 04:50:24,073 INFO L226 Difference]: Without dead ends: 230 [2021-10-29 04:50:24,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-29 04:50:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2021-10-29 04:50:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.2281553398058251) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-10-29 04:50:24,133 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 25 [2021-10-29 04:50:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:24,133 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-10-29 04:50:24,134 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-29 04:50:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-10-29 04:50:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 04:50:24,135 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:24,135 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:24,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 04:50:24,135 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1509861448, now seen corresponding path program 1 times [2021-10-29 04:50:24,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:24,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164032809] [2021-10-29 04:50:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:24,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:24,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:24,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164032809] [2021-10-29 04:50:24,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164032809] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:24,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:24,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:24,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111353829] [2021-10-29 04:50:24,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:24,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:24,185 INFO L87 Difference]: Start difference. First operand 212 states and 253 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-29 04:50:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:24,278 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2021-10-29 04:50:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:50:24,279 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-29 04:50:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:24,281 INFO L225 Difference]: With dead ends: 226 [2021-10-29 04:50:24,281 INFO L226 Difference]: Without dead ends: 202 [2021-10-29 04:50:24,282 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-29 04:50:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-29 04:50:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.2091836734693877) internal successors, (237), 201 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 237 transitions. [2021-10-29 04:50:24,317 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 237 transitions. Word has length 26 [2021-10-29 04:50:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:24,317 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 237 transitions. [2021-10-29 04:50:24,317 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-29 04:50:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 237 transitions. [2021-10-29 04:50:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 04:50:24,318 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:24,319 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:24,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 04:50:24,319 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2072887667, now seen corresponding path program 1 times [2021-10-29 04:50:24,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:24,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125069365] [2021-10-29 04:50:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:24,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:24,352 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:24,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125069365] [2021-10-29 04:50:24,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125069365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:24,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:24,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:24,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806083633] [2021-10-29 04:50:24,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:24,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:24,355 INFO L87 Difference]: Start difference. First operand 202 states and 237 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-29 04:50:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:24,474 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2021-10-29 04:50:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:24,475 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-29 04:50:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:24,476 INFO L225 Difference]: With dead ends: 215 [2021-10-29 04:50:24,477 INFO L226 Difference]: Without dead ends: 201 [2021-10-29 04:50:24,477 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-29 04:50:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2021-10-29 04:50:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2021-10-29 04:50:24,512 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 26 [2021-10-29 04:50:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:24,512 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2021-10-29 04:50:24,512 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-29 04:50:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2021-10-29 04:50:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 04:50:24,513 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:24,514 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:24,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 04:50:24,514 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 182459748, now seen corresponding path program 1 times [2021-10-29 04:50:24,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:24,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523536302] [2021-10-29 04:50:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:24,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:24,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:24,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523536302] [2021-10-29 04:50:24,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523536302] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:24,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:24,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:24,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926594529] [2021-10-29 04:50:24,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:24,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:24,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:24,560 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:24,708 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2021-10-29 04:50:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:50:24,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-29 04:50:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:24,710 INFO L225 Difference]: With dead ends: 212 [2021-10-29 04:50:24,711 INFO L226 Difference]: Without dead ends: 209 [2021-10-29 04:50:24,711 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-29 04:50:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2021-10-29 04:50:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 203 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 237 transitions. [2021-10-29 04:50:24,746 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 237 transitions. Word has length 27 [2021-10-29 04:50:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:24,746 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 237 transitions. [2021-10-29 04:50:24,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 237 transitions. [2021-10-29 04:50:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 04:50:24,748 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:24,748 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:24,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 04:50:24,748 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 182447832, now seen corresponding path program 1 times [2021-10-29 04:50:24,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:24,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93668168] [2021-10-29 04:50:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:24,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:24,849 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:24,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93668168] [2021-10-29 04:50:24,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93668168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:24,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:24,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:24,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055275660] [2021-10-29 04:50:24,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:24,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:24,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:24,855 INFO L87 Difference]: Start difference. First operand 204 states and 237 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-29 04:50:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:25,037 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2021-10-29 04:50:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:25,037 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-29 04:50:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:25,039 INFO L225 Difference]: With dead ends: 209 [2021-10-29 04:50:25,040 INFO L226 Difference]: Without dead ends: 190 [2021-10-29 04:50:25,040 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-10-29 04:50:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-10-29 04:50:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.1945945945945946) internal successors, (221), 189 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-10-29 04:50:25,087 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 27 [2021-10-29 04:50:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:25,087 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-10-29 04:50:25,088 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-29 04:50:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-10-29 04:50:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 04:50:25,089 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:25,089 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:25,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 04:50:25,090 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash -959516531, now seen corresponding path program 1 times [2021-10-29 04:50:25,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:25,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658851743] [2021-10-29 04:50:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:25,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:25,176 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:25,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658851743] [2021-10-29 04:50:25,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658851743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:25,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:25,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:25,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575422685] [2021-10-29 04:50:25,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:25,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:25,179 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:25,413 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-10-29 04:50:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:50:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-29 04:50:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:25,415 INFO L225 Difference]: With dead ends: 266 [2021-10-29 04:50:25,416 INFO L226 Difference]: Without dead ends: 198 [2021-10-29 04:50:25,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-29 04:50:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2021-10-29 04:50:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2021-10-29 04:50:25,450 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 27 [2021-10-29 04:50:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:25,450 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2021-10-29 04:50:25,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2021-10-29 04:50:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 04:50:25,451 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:25,452 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:25,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 04:50:25,452 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:25,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1342183885, now seen corresponding path program 1 times [2021-10-29 04:50:25,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:25,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349775089] [2021-10-29 04:50:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:25,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:25,510 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:25,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349775089] [2021-10-29 04:50:25,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349775089] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:25,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:25,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:50:25,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244713422] [2021-10-29 04:50:25,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:25,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:25,516 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-29 04:50:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:25,648 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-10-29 04:50:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:25,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-29 04:50:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:25,650 INFO L225 Difference]: With dead ends: 212 [2021-10-29 04:50:25,650 INFO L226 Difference]: Without dead ends: 208 [2021-10-29 04:50:25,651 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-29 04:50:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2021-10-29 04:50:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 173 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2021-10-29 04:50:25,683 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 29 [2021-10-29 04:50:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:25,684 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2021-10-29 04:50:25,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-29 04:50:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2021-10-29 04:50:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 04:50:25,685 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:25,685 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:25,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 04:50:25,686 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash -238254628, now seen corresponding path program 1 times [2021-10-29 04:50:25,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:25,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799039073] [2021-10-29 04:50:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:25,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:25,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-29 04:50:25,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:25,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799039073] [2021-10-29 04:50:25,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799039073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:25,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:25,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:50:25,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280327707] [2021-10-29 04:50:25,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:25,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:25,754 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-29 04:50:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:25,925 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2021-10-29 04:50:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:50:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-29 04:50:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:25,940 INFO L225 Difference]: With dead ends: 190 [2021-10-29 04:50:25,948 INFO L226 Difference]: Without dead ends: 116 [2021-10-29 04:50:25,949 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-29 04:50:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2021-10-29 04:50:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 99 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-29 04:50:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-10-29 04:50:25,970 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 30 [2021-10-29 04:50:25,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:25,971 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-10-29 04:50:25,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-29 04:50:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-10-29 04:50:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 04:50:25,972 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:25,972 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:25,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 04:50:25,973 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1741353200, now seen corresponding path program 1 times [2021-10-29 04:50:25,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:25,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308766932] [2021-10-29 04:50:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:25,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:26,092 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:26,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308766932] [2021-10-29 04:50:26,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308766932] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:26,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:26,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 04:50:26,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592868163] [2021-10-29 04:50:26,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 04:50:26,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 04:50:26,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:26,095 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-29 04:50:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:26,429 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2021-10-29 04:50:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 04:50:26,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-29 04:50:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:26,431 INFO L225 Difference]: With dead ends: 133 [2021-10-29 04:50:26,431 INFO L226 Difference]: Without dead ends: 131 [2021-10-29 04:50:26,432 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-29 04:50:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-29 04:50:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2021-10-29 04:50:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 99 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-29 04:50:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-10-29 04:50:26,455 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 33 [2021-10-29 04:50:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:26,455 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-10-29 04:50:26,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-29 04:50:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-10-29 04:50:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 04:50:26,456 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:26,457 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:26,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 04:50:26,457 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2037279919, now seen corresponding path program 1 times [2021-10-29 04:50:26,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:26,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572367798] [2021-10-29 04:50:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:26,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:26,563 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:26,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572367798] [2021-10-29 04:50:26,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572367798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:26,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:26,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:26,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699033935] [2021-10-29 04:50:26,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:26,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:26,566 INFO L87 Difference]: Start difference. First operand 100 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-29 04:50:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:26,708 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2021-10-29 04:50:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:50:26,709 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-29 04:50:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:26,710 INFO L225 Difference]: With dead ends: 132 [2021-10-29 04:50:26,710 INFO L226 Difference]: Without dead ends: 130 [2021-10-29 04:50:26,711 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-10-29 04:50:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2021-10-29 04:50:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 85 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2021-10-29 04:50:26,729 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 36 [2021-10-29 04:50:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:26,730 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2021-10-29 04:50:26,730 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-29 04:50:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2021-10-29 04:50:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:50:26,731 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:26,731 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:26,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 04:50:26,732 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 781443528, now seen corresponding path program 1 times [2021-10-29 04:50:26,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:26,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728185722] [2021-10-29 04:50:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:26,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:26,854 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:26,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728185722] [2021-10-29 04:50:26,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728185722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:26,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:26,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:50:26,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590403771] [2021-10-29 04:50:26,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:26,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:26,857 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:27,010 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2021-10-29 04:50:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:50:27,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-29 04:50:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:27,011 INFO L225 Difference]: With dead ends: 102 [2021-10-29 04:50:27,012 INFO L226 Difference]: Without dead ends: 86 [2021-10-29 04:50:27,012 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:50:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-10-29 04:50:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-10-29 04:50:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2021-10-29 04:50:27,031 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 37 [2021-10-29 04:50:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:27,031 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2021-10-29 04:50:27,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2021-10-29 04:50:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:50:27,032 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:27,033 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:27,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 04:50:27,033 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 807911961, now seen corresponding path program 1 times [2021-10-29 04:50:27,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:27,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835831298] [2021-10-29 04:50:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:27,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:27,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:27,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835831298] [2021-10-29 04:50:27,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835831298] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:27,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:27,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:50:27,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532662471] [2021-10-29 04:50:27,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:27,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:27,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:27,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:27,106 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:27,224 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2021-10-29 04:50:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:50:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-29 04:50:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:27,226 INFO L225 Difference]: With dead ends: 106 [2021-10-29 04:50:27,226 INFO L226 Difference]: Without dead ends: 88 [2021-10-29 04:50:27,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-10-29 04:50:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-10-29 04:50:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2021-10-29 04:50:27,248 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 37 [2021-10-29 04:50:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:27,249 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2021-10-29 04:50:27,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2021-10-29 04:50:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:50:27,250 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:27,250 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:27,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 04:50:27,251 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash 605372770, now seen corresponding path program 1 times [2021-10-29 04:50:27,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:27,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472844080] [2021-10-29 04:50:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:27,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:27,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-29 04:50:27,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:27,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472844080] [2021-10-29 04:50:27,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472844080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:27,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:27,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:50:27,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950959444] [2021-10-29 04:50:27,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:27,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:27,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:27,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:27,341 INFO L87 Difference]: Start difference. First operand 88 states and 100 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-29 04:50:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:27,456 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2021-10-29 04:50:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:50:27,457 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-29 04:50:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:27,458 INFO L225 Difference]: With dead ends: 102 [2021-10-29 04:50:27,458 INFO L226 Difference]: Without dead ends: 64 [2021-10-29 04:50:27,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:50:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-29 04:50:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-29 04:50:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-10-29 04:50:27,478 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 40 [2021-10-29 04:50:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:27,479 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-10-29 04:50:27,479 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-29 04:50:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-10-29 04:50:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:50:27,480 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:27,480 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:27,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 04:50:27,481 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 270788442, now seen corresponding path program 1 times [2021-10-29 04:50:27,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:27,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057577856] [2021-10-29 04:50:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:27,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:27,565 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:27,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057577856] [2021-10-29 04:50:27,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057577856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:27,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:27,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:50:27,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975178698] [2021-10-29 04:50:27,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:27,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:27,568 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-29 04:50:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:27,621 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2021-10-29 04:50:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-29 04:50:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:27,623 INFO L225 Difference]: With dead ends: 92 [2021-10-29 04:50:27,623 INFO L226 Difference]: Without dead ends: 64 [2021-10-29 04:50:27,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-29 04:50:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-29 04:50:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 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-29 04:50:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-10-29 04:50:27,641 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 40 [2021-10-29 04:50:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:27,641 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-10-29 04:50:27,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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-29 04:50:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-10-29 04:50:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-29 04:50:27,642 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:27,643 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:27,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 04:50:27,644 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash -216703206, now seen corresponding path program 1 times [2021-10-29 04:50:27,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:27,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779623840] [2021-10-29 04:50:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:27,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:27,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:27,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779623840] [2021-10-29 04:50:27,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779623840] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:27,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:27,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:50:27,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35844792] [2021-10-29 04:50:27,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:27,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:27,741 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:27,848 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-10-29 04:50:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:50:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-10-29 04:50:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:27,850 INFO L225 Difference]: With dead ends: 82 [2021-10-29 04:50:27,850 INFO L226 Difference]: Without dead ends: 64 [2021-10-29 04:50:27,850 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-29 04:50:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-29 04:50:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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-29 04:50:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-10-29 04:50:27,866 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2021-10-29 04:50:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:27,867 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-10-29 04:50:27,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-10-29 04:50:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-29 04:50:27,868 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:27,868 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:27,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 04:50:27,869 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1728484254, now seen corresponding path program 1 times [2021-10-29 04:50:27,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:27,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491050074] [2021-10-29 04:50:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:27,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:28,066 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:28,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491050074] [2021-10-29 04:50:28,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491050074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:28,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:28,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 04:50:28,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926566363] [2021-10-29 04:50:28,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:50:28,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:28,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:50:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:28,068 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:28,485 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-10-29 04:50:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 04:50:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-29 04:50:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:28,487 INFO L225 Difference]: With dead ends: 109 [2021-10-29 04:50:28,487 INFO L226 Difference]: Without dead ends: 61 [2021-10-29 04:50:28,487 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-10-29 04:50:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-10-29 04:50:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-10-29 04:50:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-10-29 04:50:28,501 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 51 [2021-10-29 04:50:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:28,501 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-10-29 04:50:28,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-10-29 04:50:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-29 04:50:28,503 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:28,503 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:28,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-29 04:50:28,503 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2021-10-29 04:50:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash -467856665, now seen corresponding path program 1 times [2021-10-29 04:50:28,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:28,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161778918] [2021-10-29 04:50:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:28,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:28,651 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:28,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161778918] [2021-10-29 04:50:28,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161778918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:28,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:28,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 04:50:28,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888820968] [2021-10-29 04:50:28,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:50:28,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:50:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:28,655 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 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-29 04:50:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:28,938 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2021-10-29 04:50:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 04:50:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 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-29 04:50:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:28,940 INFO L225 Difference]: With dead ends: 78 [2021-10-29 04:50:28,940 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 04:50:28,941 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-10-29 04:50:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 04:50:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 04:50:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 04:50:28,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-10-29 04:50:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:28,942 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 04:50:28,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 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-29 04:50:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 04:50:28,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 04:50:28,946 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,947 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,948 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,948 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,949 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,949 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,949 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,950 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,950 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,952 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,952 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,952 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,953 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,953 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,953 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,953 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,954 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,954 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,954 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,955 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,956 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,956 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,956 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,957 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,957 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,957 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,957 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,958 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,958 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,958 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,959 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,959 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,959 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,960 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,960 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:28,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-29 04:50:28,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 04:50:28,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:29,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:30,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:50:39,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,822 INFO L857 garLoopResultBuilder]: For program point L630(lines 630 632) no Hoare annotation was computed. [2021-10-29 04:50:39,822 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,822 INFO L857 garLoopResultBuilder]: For program point L565(lines 565 567) no Hoare annotation was computed. [2021-10-29 04:50:39,822 INFO L857 garLoopResultBuilder]: For program point L499(lines 499 505) no Hoare annotation was computed. [2021-10-29 04:50:39,823 INFO L853 garLoopResultBuilder]: At program point L499-1(lines 1 1151) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 04:50:39,823 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,823 INFO L853 garLoopResultBuilder]: At program point L434(lines 163 436) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse2 (= 2 ~DC~0)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse16 (not (= ~SKIP2~0 2))) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse14 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse15 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse8 (not (= ~MPR3~0 1))) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10) (and .cse16 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse12 .cse3 .cse13 .cse4 .cse10) (and .cse16 .cse12 .cse3 .cse13 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res|) 0)) (and .cse0 .cse12 .cse3 .cse13 .cse4 (= ~myStatus~0 0) .cse5 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10) (and .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse6 .cse7 .cse15 .cse8 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse9 .cse10))) [2021-10-29 04:50:39,824 INFO L853 garLoopResultBuilder]: At program point L765(lines 758 804) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse10 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse11 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~status~1 0) .cse2 .cse3 (= ~myStatus~0 0) .cse4 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse9 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) (not (= ~SKIP2~0 2)) (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse1 .cse2 .cse3) (and .cse0 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) (= 2 ~DC~0) .cse3 .cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse5 .cse6 .cse7 .cse8 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse4 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse5 .cse6 .cse11 .cse7 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse8))) [2021-10-29 04:50:39,824 INFO L860 garLoopResultBuilder]: At program point L766(lines 750 805) the Hoare annotation is: true [2021-10-29 04:50:39,824 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 310) no Hoare annotation was computed. [2021-10-29 04:50:39,825 INFO L857 garLoopResultBuilder]: For program point L767(lines 767 802) no Hoare annotation was computed. [2021-10-29 04:50:39,825 INFO L857 garLoopResultBuilder]: For program point L239-1(lines 232 420) no Hoare annotation was computed. [2021-10-29 04:50:39,825 INFO L857 garLoopResultBuilder]: For program point L768(lines 768 801) no Hoare annotation was computed. [2021-10-29 04:50:39,825 INFO L853 garLoopResultBuilder]: At program point L570(lines 531 596) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse17 (* 4294967296 .cse16))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse17 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse16 1) 0)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse17 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse13 (< 0 (+ .cse16 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse15) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) [2021-10-29 04:50:39,825 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,826 INFO L857 garLoopResultBuilder]: For program point L769(lines 769 779) no Hoare annotation was computed. [2021-10-29 04:50:39,826 INFO L857 garLoopResultBuilder]: For program point L770(lines 770 776) no Hoare annotation was computed. [2021-10-29 04:50:39,826 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,828 INFO L857 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-10-29 04:50:39,829 INFO L857 garLoopResultBuilder]: For program point L1036(lines 1036 1055) no Hoare annotation was computed. [2021-10-29 04:50:39,829 INFO L857 garLoopResultBuilder]: For program point L1036-1(lines 1036 1055) no Hoare annotation was computed. [2021-10-29 04:50:39,829 INFO L857 garLoopResultBuilder]: For program point L1036-2(lines 1036 1055) no Hoare annotation was computed. [2021-10-29 04:50:39,829 INFO L857 garLoopResultBuilder]: For program point L1036-3(lines 1036 1055) no Hoare annotation was computed. [2021-10-29 04:50:39,829 INFO L857 garLoopResultBuilder]: For program point L640(lines 640 645) no Hoare annotation was computed. [2021-10-29 04:50:39,830 INFO L857 garLoopResultBuilder]: For program point L640-2(lines 640 645) no Hoare annotation was computed. [2021-10-29 04:50:39,830 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,830 INFO L857 garLoopResultBuilder]: For program point L1037(lines 1037 1042) no Hoare annotation was computed. [2021-10-29 04:50:39,830 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,837 INFO L857 garLoopResultBuilder]: For program point L1037-2(lines 1037 1042) no Hoare annotation was computed. [2021-10-29 04:50:39,838 INFO L857 garLoopResultBuilder]: For program point L1037-4(lines 1037 1042) no Hoare annotation was computed. [2021-10-29 04:50:39,838 INFO L857 garLoopResultBuilder]: For program point L1037-6(lines 1037 1042) no Hoare annotation was computed. [2021-10-29 04:50:39,838 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,838 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,838 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-10-29 04:50:39,838 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,839 INFO L853 garLoopResultBuilder]: At program point L710(lines 704 808) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse2 (= 2 ~DC~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse15 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse16 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0)) (.cse17 (not (= ~SKIP2~0 2))) (.cse13 (= ~s~0 ~DC~0)) (.cse14 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse6 .cse7 .cse16 .cse8 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse9 .cse10) (and .cse0 .cse13 (= ULTIMATE.start_main_~status~1 0) .cse14 .cse3 (= ~myStatus~0 0) .cse4 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) .cse17 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse13 .cse14 .cse3 .cse10) (and (<= (+ 1073741823 ULTIMATE.start_main_~status~1) 0) .cse17 .cse13 .cse14 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse3 .cse4 .cse6 .cse7 .cse8 (<= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res|) 0)))) [2021-10-29 04:50:39,839 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,839 INFO L857 garLoopResultBuilder]: For program point L380(lines 380 386) no Hoare annotation was computed. [2021-10-29 04:50:39,839 INFO L853 garLoopResultBuilder]: At program point L647(lines 615 649) 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)) (.cse17 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse18 1) 0)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse13 (< 0 (+ .cse18 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (= ~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) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse15 .cse16) (and .cse0 .cse1 (or .cse17 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) [2021-10-29 04:50:39,839 INFO L857 garLoopResultBuilder]: For program point L515(lines 515 520) no Hoare annotation was computed. [2021-10-29 04:50:39,840 INFO L853 garLoopResultBuilder]: At program point L515-2(lines 515 520) 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_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,840 INFO L853 garLoopResultBuilder]: At program point L1044(lines 1036 1055) the Hoare annotation is: false [2021-10-29 04:50:39,840 INFO L853 garLoopResultBuilder]: At program point L1044-1(lines 1036 1055) 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) (= ~setEventCalled~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (= ~NP~0 1) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (not (= ~MPR3~0 ~s~0))))) [2021-10-29 04:50:39,840 INFO L853 garLoopResultBuilder]: At program point L1044-2(lines 1036 1055) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2021-10-29 04:50:39,841 INFO L853 garLoopResultBuilder]: At program point L1044-3(lines 1036 1055) 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) (= ~setEventCalled~0 1) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~pended~0 0) (not (= ~MPR3~0 ~s~0))))) [2021-10-29 04:50:39,841 INFO L853 garLoopResultBuilder]: At program point L979(lines 943 1007) 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) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,841 INFO L853 garLoopResultBuilder]: At program point L979-1(lines 943 1007) 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) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,842 INFO L853 garLoopResultBuilder]: At program point L979-2(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,842 INFO L853 garLoopResultBuilder]: At program point L979-3(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,842 INFO L853 garLoopResultBuilder]: At program point L979-4(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,842 INFO L853 garLoopResultBuilder]: At program point L979-5(lines 943 1007) 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) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 04:50:39,843 INFO L853 garLoopResultBuilder]: At program point L979-6(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,843 INFO L853 garLoopResultBuilder]: At program point L781(lines 768 801) the Hoare annotation is: (let ((.cse6 (= ~s~0 ~DC~0)) (.cse7 (= 2 ~s~0)) (.cse8 (not (= ~IPC~0 2)))) (let ((.cse1 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse3 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse4 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse0 (let ((.cse9 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse10 (<= 3 ~SKIP1~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= ~NP~0 1)) (.cse13 (not (= ~MPR3~0 1)))) (or (and .cse9 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse8 .cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse11 .cse12 .cse13 (= ~SKIP2~0 ~s~0)) (and .cse9 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13)))) (.cse2 (= 2 ~DC~0)) (.cse5 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse4 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse5) (and .cse0 .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~myStatus~0 0) (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse5 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) (not (= ~SKIP2~0 2)) (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse6 .cse7 .cse8) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 (not .cse7) .cse5)))) [2021-10-29 04:50:39,843 INFO L853 garLoopResultBuilder]: At program point L979-7(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,844 INFO L853 garLoopResultBuilder]: At program point L979-8(lines 943 1007) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,844 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,844 INFO L853 garLoopResultBuilder]: At program point L121(lines 121 151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,844 INFO L857 garLoopResultBuilder]: For program point L121-2(lines 113 161) no Hoare annotation was computed. [2021-10-29 04:50:39,845 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 334) no Hoare annotation was computed. [2021-10-29 04:50:39,845 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 04:50:39,845 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,845 INFO L857 garLoopResultBuilder]: For program point L1049(lines 1049 1053) no Hoare annotation was computed. [2021-10-29 04:50:39,846 INFO L853 garLoopResultBuilder]: At program point L1049-1(lines 1049 1053) 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_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,846 INFO L857 garLoopResultBuilder]: For program point L1049-2(lines 1049 1053) no Hoare annotation was computed. [2021-10-29 04:50:39,846 INFO L853 garLoopResultBuilder]: At program point L1049-3(lines 1049 1053) 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_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,846 INFO L857 garLoopResultBuilder]: For program point L1049-4(lines 1049 1053) no Hoare annotation was computed. [2021-10-29 04:50:39,847 INFO L853 garLoopResultBuilder]: At program point L1049-5(lines 1049 1053) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,847 INFO L857 garLoopResultBuilder]: For program point L1049-6(lines 1049 1053) no Hoare annotation was computed. [2021-10-29 04:50:39,847 INFO L853 garLoopResultBuilder]: At program point L1049-7(lines 1049 1053) 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) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ~pended~0 0)))) [2021-10-29 04:50:39,848 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,848 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,848 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,848 INFO L857 garLoopResultBuilder]: For program point L787(lines 787 799) no Hoare annotation was computed. [2021-10-29 04:50:39,848 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,849 INFO L857 garLoopResultBuilder]: For program point L788(lines 788 792) no Hoare annotation was computed. [2021-10-29 04:50:39,849 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,849 INFO L857 garLoopResultBuilder]: For program point L987(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,849 INFO L857 garLoopResultBuilder]: For program point L987-1(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,849 INFO L857 garLoopResultBuilder]: For program point L987-2(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,850 INFO L857 garLoopResultBuilder]: For program point L987-3(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,850 INFO L857 garLoopResultBuilder]: For program point L987-4(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,850 INFO L857 garLoopResultBuilder]: For program point L987-5(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,850 INFO L857 garLoopResultBuilder]: For program point L987-6(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,850 INFO L857 garLoopResultBuilder]: For program point L987-7(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,851 INFO L857 garLoopResultBuilder]: For program point L987-8(lines 987 1004) no Hoare annotation was computed. [2021-10-29 04:50:39,851 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 333) no Hoare annotation was computed. [2021-10-29 04:50:39,851 INFO L853 garLoopResultBuilder]: At program point L327-1(lines 1 1151) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 04:50:39,851 INFO L857 garLoopResultBuilder]: For program point L263(lines 263 294) no Hoare annotation was computed. [2021-10-29 04:50:39,851 INFO L857 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,852 INFO L857 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,852 INFO L857 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,852 INFO L857 garLoopResultBuilder]: For program point L65-3(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,852 INFO L857 garLoopResultBuilder]: For program point L65-4(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,852 INFO L857 garLoopResultBuilder]: For program point L65-5(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,853 INFO L857 garLoopResultBuilder]: For program point L65-6(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,853 INFO L857 garLoopResultBuilder]: For program point L65-7(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,853 INFO L857 garLoopResultBuilder]: For program point L65-8(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,853 INFO L857 garLoopResultBuilder]: For program point L65-9(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,854 INFO L857 garLoopResultBuilder]: For program point L65-10(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,854 INFO L857 garLoopResultBuilder]: For program point L65-11(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,854 INFO L857 garLoopResultBuilder]: For program point L65-12(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,854 INFO L857 garLoopResultBuilder]: For program point L65-13(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,854 INFO L857 garLoopResultBuilder]: For program point L65-14(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,855 INFO L857 garLoopResultBuilder]: For program point L65-15(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,855 INFO L857 garLoopResultBuilder]: For program point L65-16(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,855 INFO L857 garLoopResultBuilder]: For program point L65-17(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,855 INFO L857 garLoopResultBuilder]: For program point L65-18(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,855 INFO L857 garLoopResultBuilder]: For program point L65-19(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,856 INFO L857 garLoopResultBuilder]: For program point L65-20(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,856 INFO L857 garLoopResultBuilder]: For program point L65-21(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,856 INFO L857 garLoopResultBuilder]: For program point L65-22(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,856 INFO L857 garLoopResultBuilder]: For program point L65-23(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,856 INFO L857 garLoopResultBuilder]: For program point L65-24(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,857 INFO L857 garLoopResultBuilder]: For program point L65-25(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,857 INFO L857 garLoopResultBuilder]: For program point L65-26(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,857 INFO L857 garLoopResultBuilder]: For program point L65-27(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,857 INFO L857 garLoopResultBuilder]: For program point L65-28(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,858 INFO L853 garLoopResultBuilder]: At program point L132(lines 132 139) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,858 INFO L857 garLoopResultBuilder]: For program point L65-29(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,858 INFO L857 garLoopResultBuilder]: For program point L65-30(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,858 INFO L853 garLoopResultBuilder]: At program point L66(lines 1009 1022) 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-29 04:50:39,858 INFO L857 garLoopResultBuilder]: For program point L65-31(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,859 INFO L857 garLoopResultBuilder]: For program point L65-32(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,859 INFO L857 garLoopResultBuilder]: For program point L65-33(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,859 INFO L857 garLoopResultBuilder]: For program point L65-34(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,859 INFO L853 garLoopResultBuilder]: At program point L66-4(lines 1 1151) 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) (or (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~MPR3~0 ~s~0)) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (= ~s~0 ~NP~0)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,860 INFO L857 garLoopResultBuilder]: For program point L65-35(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,860 INFO L857 garLoopResultBuilder]: For program point L65-36(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,860 INFO L857 garLoopResultBuilder]: For program point L65-37(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,860 INFO L853 garLoopResultBuilder]: At program point L66-7(lines 1 1151) 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) (or (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~MPR3~0 ~s~0)) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (= ~s~0 ~NP~0)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,861 INFO L857 garLoopResultBuilder]: For program point L65-38(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,861 INFO L857 garLoopResultBuilder]: For program point L65-39(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,861 INFO L853 garLoopResultBuilder]: At program point L66-9(lines 1009 1022) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse17 (* 4294967296 .cse16))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= 2 ~s~0)) (.cse5 (< (+ .cse17 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse6 (<= (+ .cse16 1) 0)) (.cse7 (not (= ~IPC~0 2))) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse17 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse13 (< 0 (+ .cse16 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse15) (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) [2021-10-29 04:50:39,862 INFO L853 garLoopResultBuilder]: At program point L66-10(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,862 INFO L853 garLoopResultBuilder]: At program point L66-12(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 04:50:39,862 INFO L853 garLoopResultBuilder]: At program point L66-13(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,862 INFO L853 garLoopResultBuilder]: At program point L66-15(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,863 INFO L853 garLoopResultBuilder]: At program point L66-17(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 04:50:39,863 INFO L853 garLoopResultBuilder]: At program point L66-19(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,863 INFO L853 garLoopResultBuilder]: At program point L66-21(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 04:50:39,864 INFO L853 garLoopResultBuilder]: At program point L66-25(lines 1 1151) 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) (or (not (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ~MPR3~0 ~s~0)) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (= ~s~0 ~NP~0)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-29 04:50:39,864 INFO L853 garLoopResultBuilder]: At program point L66-28(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,864 INFO L853 garLoopResultBuilder]: At program point L66-30(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 04:50:39,864 INFO L853 garLoopResultBuilder]: At program point L66-31(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,865 INFO L853 garLoopResultBuilder]: At program point L66-33(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 04:50:39,865 INFO L853 garLoopResultBuilder]: At program point L66-34(lines 1 1151) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,865 INFO L857 garLoopResultBuilder]: For program point L926(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,865 INFO L853 garLoopResultBuilder]: At program point L66-36(lines 1 1151) the Hoare annotation is: (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-29 04:50:39,866 INFO L857 garLoopResultBuilder]: For program point L926-2(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,866 INFO L857 garLoopResultBuilder]: For program point L926-4(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,866 INFO L857 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-10-29 04:50:39,866 INFO L857 garLoopResultBuilder]: For program point L926-6(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,866 INFO L857 garLoopResultBuilder]: For program point L926-8(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,867 INFO L857 garLoopResultBuilder]: For program point L926-10(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,867 INFO L857 garLoopResultBuilder]: For program point L926-12(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,867 INFO L857 garLoopResultBuilder]: For program point L926-14(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,867 INFO L857 garLoopResultBuilder]: For program point L926-16(lines 926 932) no Hoare annotation was computed. [2021-10-29 04:50:39,867 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 596) no Hoare annotation was computed. [2021-10-29 04:50:39,867 INFO L857 garLoopResultBuilder]: For program point L531-1(lines 531 596) no Hoare annotation was computed. [2021-10-29 04:50:39,868 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 209) no Hoare annotation was computed. [2021-10-29 04:50:39,868 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,868 INFO L857 garLoopResultBuilder]: For program point L533(lines 533 573) no Hoare annotation was computed. [2021-10-29 04:50:39,868 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,869 INFO L857 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,869 INFO L857 garLoopResultBuilder]: For program point L996-2(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,869 INFO L857 garLoopResultBuilder]: For program point L996-4(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,869 INFO L857 garLoopResultBuilder]: For program point L996-6(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,869 INFO L857 garLoopResultBuilder]: For program point L996-8(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,870 INFO L857 garLoopResultBuilder]: For program point L996-10(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,870 INFO L857 garLoopResultBuilder]: For program point L996-12(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,870 INFO L853 garLoopResultBuilder]: At program point L534(lines 534 544) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse4 (= 2 ~DC~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ .cse19 1) 0)) (.cse3 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse8 (not (= ~IPC~0 2))) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse11 (<= 3 ~SKIP1~0)) (.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (= ~NP~0 1)) (.cse14 (not (= ~MPR3~0 1))) (.cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse15 (< 0 (+ .cse19 2))) (.cse16 (<= 4 ~SKIP2~0)) (.cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse2) (or .cse3 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse4 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse17 .cse18))))) [2021-10-29 04:50:39,870 INFO L857 garLoopResultBuilder]: For program point L996-14(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,871 INFO L857 garLoopResultBuilder]: For program point L996-16(lines 996 1003) no Hoare annotation was computed. [2021-10-29 04:50:39,871 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,871 INFO L853 garLoopResultBuilder]: At program point L733(lines 733 748) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,871 INFO L853 garLoopResultBuilder]: At program point L667(lines 727 729) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,872 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,872 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,872 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,872 INFO L857 garLoopResultBuilder]: For program point L274(lines 274 280) no Hoare annotation was computed. [2021-10-29 04:50:39,873 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,873 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,873 INFO L853 garLoopResultBuilder]: At program point L210(lines 210 429) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 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-29 04:50:39,873 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,874 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 348) no Hoare annotation was computed. [2021-10-29 04:50:39,874 INFO L857 garLoopResultBuilder]: For program point L343-2(lines 343 348) no Hoare annotation was computed. [2021-10-29 04:50:39,874 INFO L860 garLoopResultBuilder]: At program point L807(lines 670 809) the Hoare annotation is: true [2021-10-29 04:50:39,874 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 428) no Hoare annotation was computed. [2021-10-29 04:50:39,874 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 149) no Hoare annotation was computed. [2021-10-29 04:50:39,875 INFO L853 garLoopResultBuilder]: At program point L546(lines 533 573) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse4 (= 2 ~DC~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ .cse19 1) 0)) (.cse3 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse8 (not (= ~IPC~0 2))) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse11 (<= 3 ~SKIP1~0)) (.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (= ~NP~0 1)) (.cse14 (not (= ~MPR3~0 1))) (.cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse15 (< 0 (+ .cse19 2))) (.cse16 (<= 4 ~SKIP2~0)) (.cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse2) (or .cse3 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse4 .cse5 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse17 .cse18))))) [2021-10-29 04:50:39,875 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,875 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 427) no Hoare annotation was computed. [2021-10-29 04:50:39,875 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,876 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,876 INFO L853 garLoopResultBuilder]: At program point L217(lines 213 428) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,876 INFO L853 garLoopResultBuilder]: At program point L944(lines 944 956) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 04:50:39,877 INFO L853 garLoopResultBuilder]: At program point L944-1(lines 944 956) 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) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,877 INFO L853 garLoopResultBuilder]: At program point L944-2(lines 944 956) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 04:50:39,877 INFO L853 garLoopResultBuilder]: At program point L944-3(lines 944 956) 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) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 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-29 04:50:39,877 INFO L853 garLoopResultBuilder]: At program point L944-4(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,878 INFO L853 garLoopResultBuilder]: At program point L944-5(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,878 INFO L853 garLoopResultBuilder]: At program point L944-6(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,878 INFO L853 garLoopResultBuilder]: At program point L944-7(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,879 INFO L853 garLoopResultBuilder]: At program point L944-8(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,879 INFO L853 garLoopResultBuilder]: At program point L944-9(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,879 INFO L853 garLoopResultBuilder]: At program point L944-10(lines 944 956) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-29 04:50:39,879 INFO L853 garLoopResultBuilder]: At program point L944-11(lines 944 956) 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) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ .cse1 1) 0) (not (= ~IPC~0 2)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-29 04:50:39,880 INFO L853 garLoopResultBuilder]: At program point L944-12(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,880 INFO L853 garLoopResultBuilder]: At program point L944-13(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,880 INFO L853 garLoopResultBuilder]: At program point L944-14(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,880 INFO L853 garLoopResultBuilder]: At program point L944-15(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,881 INFO L853 garLoopResultBuilder]: At program point L944-16(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,881 INFO L853 garLoopResultBuilder]: At program point L944-17(lines 944 956) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (<= 3 ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,881 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-29 04:50:39,881 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,882 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 426) no Hoare annotation was computed. [2021-10-29 04:50:39,882 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,882 INFO L853 garLoopResultBuilder]: At program point L88(lines 710 749) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= 2 ~s~0)) (not (= ~IPC~0 2)) (= ~myStatus~0 0) (<= 3 ~SKIP1~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ 2 ~s~0) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1))) [2021-10-29 04:50:39,882 INFO L857 garLoopResultBuilder]: For program point L1013(lines 1013 1019) no Hoare annotation was computed. [2021-10-29 04:50:39,883 INFO L857 garLoopResultBuilder]: For program point L1013-2(lines 1013 1019) no Hoare annotation was computed. [2021-10-29 04:50:39,883 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,883 INFO L857 garLoopResultBuilder]: For program point L1013-4(lines 1013 1019) no Hoare annotation was computed. [2021-10-29 04:50:39,883 INFO L857 garLoopResultBuilder]: For program point L1013-6(lines 1013 1019) no Hoare annotation was computed. [2021-10-29 04:50:39,884 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 425) no Hoare annotation was computed. [2021-10-29 04:50:39,884 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,884 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,884 INFO L857 garLoopResultBuilder]: For program point L751(lines 751 755) no Hoare annotation was computed. [2021-10-29 04:50:39,885 INFO L853 garLoopResultBuilder]: At program point L553-2(lines 553 569) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse19 1) 0)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse17 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse13 (< 0 (+ .cse19 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse17) (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse15 .cse16))))) [2021-10-29 04:50:39,885 INFO L853 garLoopResultBuilder]: At program point L421(lines 232 422) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse5 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse11 (= ~pended~0 0)) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (not (= ~IPC~0 2))) (.cse6 (<= 3 ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse10 (<= 4 ~SKIP2~0))) (or (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~myStatus~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse11) (and (not (= ~SKIP2~0 2)) .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse7 .cse8 .cse9 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse10 .cse11) (and .cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= 2 ~DC~0) .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~SKIP2~0 ~s~0)))) [2021-10-29 04:50:39,885 INFO L853 garLoopResultBuilder]: At program point L223(lines 219 426) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,886 INFO L857 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,886 INFO L857 garLoopResultBuilder]: For program point L950-2(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,886 INFO L857 garLoopResultBuilder]: For program point L950-4(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,886 INFO L857 garLoopResultBuilder]: For program point L950-6(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,886 INFO L857 garLoopResultBuilder]: For program point L950-8(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,887 INFO L857 garLoopResultBuilder]: For program point L950-10(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,887 INFO L853 garLoopResultBuilder]: At program point L554(lines 553 569) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse5 (<= (+ .cse19 1) 0)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= ~NP~0 1)) (.cse12 (not (= ~MPR3~0 1))) (.cse17 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse13 (< 0 (+ .cse19 2))) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse17) (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (or (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) .cse15 .cse16))))) [2021-10-29 04:50:39,887 INFO L857 garLoopResultBuilder]: For program point L950-12(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,887 INFO L857 garLoopResultBuilder]: For program point L950-14(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,888 INFO L857 garLoopResultBuilder]: For program point L950-16(lines 950 954) no Hoare annotation was computed. [2021-10-29 04:50:39,888 INFO L853 garLoopResultBuilder]: At program point L225(lines 225 424) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,888 INFO L853 garLoopResultBuilder]: At program point L160(lines 100 162) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (= ~compRegistered~0 0))) (or (and (not (= ~SKIP2~0 2)) .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~pended~0 0) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 ~SKIP2~0) .cse8))) [2021-10-29 04:50:39,888 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,889 INFO L853 garLoopResultBuilder]: At program point L228(lines 228 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,889 INFO L853 garLoopResultBuilder]: At program point L757(lines 750 805) the Hoare annotation is: (let ((.cse1 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse2 (= 2 ~DC~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse15 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258))) (.cse16 (or (<= |ULTIMATE.start_FloppyPnp_#res| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res|))) (.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= 4 ~SKIP2~0)) (.cse10 (= ~pended~0 0)) (.cse17 (not (= ~SKIP2~0 2))) (.cse13 (= ~s~0 ~DC~0)) (.cse14 (= 2 ~s~0)) (.cse3 (not (= ~IPC~0 2))) (.cse4 (<= 3 ~SKIP1~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~NP~0 1)) (.cse8 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4 (or (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 259) (<= ULTIMATE.start_FloppyPnp_~__cil_tmp30~0 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse6 .cse7 .cse16 .cse8 (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (< 258 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) .cse9 .cse10) (and .cse0 .cse13 (= ULTIMATE.start_main_~status~1 0) .cse14 .cse3 (= ~myStatus~0 0) .cse4 (= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse10) (and (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0) .cse17 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse13 .cse14 .cse3 .cse10) (and (<= (+ 1073741823 ULTIMATE.start_main_~status~1) 0) .cse17 .cse13 .cse14 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse3 .cse4 .cse6 .cse7 .cse8 (<= (+ 1073741823 |ULTIMATE.start_FloppyPnp_#res|) 0)))) [2021-10-29 04:50:39,889 INFO L857 garLoopResultBuilder]: For program point L494(lines 494 506) no Hoare annotation was computed. [2021-10-29 04:50:39,890 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,890 INFO L857 garLoopResultBuilder]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-10-29 04:50:39,890 INFO L857 garLoopResultBuilder]: For program point L363(lines 363 369) no Hoare annotation was computed. [2021-10-29 04:50:39,890 INFO L853 garLoopResultBuilder]: At program point L231(lines 230 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (<= 3 ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-29 04:50:39,891 INFO L857 garLoopResultBuilder]: For program point L298-1(lines 232 420) no Hoare annotation was computed. [2021-10-29 04:50:39,891 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,891 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-29 04:50:39,895 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:39,898 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:50:39,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:50:39 BoogieIcfgContainer [2021-10-29 04:50:39,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:50:39,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:50:39,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:50:39,996 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:50:39,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:17" (3/4) ... [2021-10-29 04:50:40,001 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 04:50:40,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 215 nodes and edges [2021-10-29 04:50:40,048 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2021-10-29 04:50:40,053 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-29 04:50:40,058 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-29 04:50:40,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) [2021-10-29 04:50:40,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) [2021-10-29 04:50:40,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) || ((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || ((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) [2021-10-29 04:50:40,105 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) || (((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && status == 0) && myStatus == 0) && \result == 0) && 4 <= SKIP2) && ntStatus == 0)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((260 <= ntStatus || ntStatus <= 258) && (((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 4 <= SKIP2)) || ((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && !(2 == s)) && 4 <= SKIP2) [2021-10-29 04:50:40,117 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0) [2021-10-29 04:50:40,122 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(SKIP2 == 2) && 2 == DC) && !(259 == \result)) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) || (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) [2021-10-29 04:50:40,128 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-29 04:50:40,129 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-29 04:50:40,129 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-29 04:50:40,130 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-29 04:50:40,130 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) [2021-10-29 04:50:40,370 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 04:50:40,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:50:40,373 INFO L168 Benchmark]: Toolchain (without parser) took 26902.34 ms. Allocated memory was 121.6 MB in the beginning and 343.9 MB in the end (delta: 222.3 MB). Free memory was 87.9 MB in the beginning and 153.4 MB in the end (delta: -65.5 MB). Peak memory consumption was 156.8 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,373 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 94.4 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:50:40,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.51 ms. Allocated memory is still 121.6 MB. Free memory was 87.6 MB in the beginning and 88.3 MB in the end (delta: -627.3 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.83 ms. Allocated memory is still 121.6 MB. Free memory was 88.3 MB in the beginning and 80.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,376 INFO L168 Benchmark]: Boogie Preprocessor took 174.68 ms. Allocated memory is still 121.6 MB. Free memory was 80.3 MB in the beginning and 75.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,376 INFO L168 Benchmark]: RCFGBuilder took 3189.34 ms. Allocated memory was 121.6 MB in the beginning and 161.5 MB in the end (delta: 39.8 MB). Free memory was 75.8 MB in the beginning and 79.6 MB in the end (delta: -3.8 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,377 INFO L168 Benchmark]: TraceAbstraction took 22349.84 ms. Allocated memory was 161.5 MB in the beginning and 343.9 MB in the end (delta: 182.5 MB). Free memory was 78.7 MB in the beginning and 186.9 MB in the end (delta: -108.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,377 INFO L168 Benchmark]: Witness Printer took 375.21 ms. Allocated memory is still 343.9 MB. Free memory was 186.9 MB in the beginning and 153.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:40,381 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.35 ms. Allocated memory is still 94.4 MB. Free memory is still 47.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 649.51 ms. Allocated memory is still 121.6 MB. Free memory was 87.6 MB in the beginning and 88.3 MB in the end (delta: -627.3 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 147.83 ms. Allocated memory is still 121.6 MB. Free memory was 88.3 MB in the beginning and 80.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 174.68 ms. Allocated memory is still 121.6 MB. Free memory was 80.3 MB in the beginning and 75.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3189.34 ms. Allocated memory was 121.6 MB in the beginning and 161.5 MB in the end (delta: 39.8 MB). Free memory was 75.8 MB in the beginning and 79.6 MB in the end (delta: -3.8 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22349.84 ms. Allocated memory was 161.5 MB in the beginning and 343.9 MB in the end (delta: 182.5 MB). Free memory was 78.7 MB in the beginning and 186.9 MB in the end (delta: -108.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 16.1 GB. * Witness Printer took 375.21 ms. Allocated memory is still 343.9 MB. Free memory was 186.9 MB in the beginning and 153.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: 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, 255 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6718 SDtfs, 5346 SDslu, 7014 SDs, 0 SdLazy, 2938 SolverSat, 385 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=6, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 546 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 82 PreInvPairs, 247 NumberOfFragments, 6910 HoareAnnotationTreeSize, 82 FomulaSimplifications, 440009 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 82 FomulaSimplificationsInter, 42180 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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 40 specifications checked. All of them hold - InvariantResult [Line: 704]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 670]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (!(259 == returnVal2) || MPR3 == s)) && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && !(259 == returnVal2)) && ntStatus == 0) && pended == 0) && !(MPR3 == s) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) || ((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || ((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || (((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((!(SKIP2 == 2) && 2 == DC) && !(259 == \result)) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) || (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && setEventCalled == 1) && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && !(259 == returnVal2)) && pended == 0) && !(MPR3 == s) - InvariantResult [Line: 710]: Loop Invariant Derived loop invariant: ((((((((((((((2 == DC && status == 0) && !(2 == s)) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && !(MPR3 == s)) && !(s == 1) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: (((((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) || (((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && status == 0) && myStatus == 0) && \result == 0) && 4 <= SKIP2) && ntStatus == 0)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((260 <= ntStatus || ntStatus <= 258) && (((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)))) && (status <= 258 || 260 <= status)) && 2 == DC) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 4 <= SKIP2)) || ((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && SKIP2 == s) || (((((((lowerDriverReturn == returnVal2 && s == DC) && 2 == s) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) && 2 == DC) && !(2 == s)) && 4 <= SKIP2) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) || ((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || (((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1))) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && ntStatus == lowerDriverReturn) && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1009]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 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: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((lowerDriverReturn == returnVal2 && 2 == DC) && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (!(259 == returnVal2) || MPR3 == s)) && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (!(259 == returnVal2) || MPR3 == s)) && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || (((((((((((((lowerDriverReturn == returnVal2 && (260 <= ntStatus || ntStatus <= 258)) && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0)) || (((((((((((lowerDriverReturn == returnVal2 && lowerDriverReturn == \result) && ntStatus == lowerDriverReturn) && 2 == DC) && !(IPC == 2)) && 3 <= SKIP1) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((((lowerDriverReturn == returnVal2 && (status <= 258 || 260 <= status)) && s == DC) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && (__cil_tmp30 <= 259 || __cil_tmp30 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && (\result <= 258 || 260 <= \result)) && !(MPR3 == 1)) && (ntStatus <= __cil_tmp30 || 258 < __cil_tmp30)) && 4 <= SKIP2) && pended == 0)) || (((((((((((((lowerDriverReturn == returnVal2 && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && myStatus == 0) && 3 <= SKIP1) && \result == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((1073741823 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && ntStatus + 1073741823 <= 0) && !(IPC == 2)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 1073741823 + \result <= 0) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 2 == DC) && status == 0) && !(IPC == 2)) && s == NP) && myStatus == 0) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1009]: Loop Invariant Derived loop invariant: (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && status == 0) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && s == DC) && status == 0) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (260 <= ntStatus || ntStatus <= 258)) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && !(IPC == 2)) && s == NP) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && !(IPC == 2)) && 3 <= SKIP1) && 2 + s <= MPR1) && NP == 1) && !(MPR3 == 1)) && 4 <= SKIP2) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && ntStatus + 1 <= 0) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (260 <= ntStatus || ntStatus <= 258)) && (\result <= 258 || 260 <= \result)) && 2 == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && (ntStatus <= __cil_tmp11 || 258 < __cil_tmp11)) && NP == 1) && !(MPR3 == 1)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0)) || ((((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && (ntStatus == 0 || ntStatus + 1073741637 == 0)) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && !(IPC == 2)) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 3 <= SKIP1) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) RESULT: Ultimate proved your program to be correct! [2021-10-29 04:50:40,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3d03305-2704-4777-9a7e-eb2feaacbee2/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...