./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8 --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 3dcfb71b16f6783353008d1be8597dab2a9bd20e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:44:15,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:44:15,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:44:15,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:44:15,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:44:15,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:44:15,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:44:15,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:44:15,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:44:15,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:44:15,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:44:15,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:44:15,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:44:15,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:44:15,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:44:15,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:44:15,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:44:15,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:44:15,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:44:15,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:44:15,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:44:15,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:44:15,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:44:15,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:44:15,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:44:15,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:44:15,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:44:15,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:44:15,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:44:15,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:44:15,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:44:15,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:44:15,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:44:15,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:44:15,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:44:15,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:44:15,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:44:15,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:44:15,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:44:15,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:44:15,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:44:15,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 06:44:15,582 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:44:15,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:44:15,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:44:15,583 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:44:15,583 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:44:15,584 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:44:15,584 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 06:44:15,584 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:44:15,584 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:44:15,584 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 06:44:15,585 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 06:44:15,585 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:44:15,585 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 06:44:15,585 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 06:44:15,585 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 06:44:15,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:44:15,591 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:44:15,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:44:15,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:44:15,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:44:15,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 06:44:15,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:44:15,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 06:44:15,593 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:44:15,594 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:44:15,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 06:44:15,594 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:44:15,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 06:44:15,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:44:15,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:44:15,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:15,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:44:15,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:44:15,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 06:44:15,599 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 06:44:15,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 06:44:15,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 06:44:15,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:44:15,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:44:15,601 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_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/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_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8 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 -> 3dcfb71b16f6783353008d1be8597dab2a9bd20e [2021-10-13 06:44:15,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:44:15,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:44:15,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:44:15,921 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:44:15,922 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:44:15,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-13 06:44:16,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/data/9a13a5098/34c2fd5b17484b0b8a612793b0ae5040/FLAG472ceade9 [2021-10-13 06:44:16,589 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:44:16,590 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-13 06:44:16,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/data/9a13a5098/34c2fd5b17484b0b8a612793b0ae5040/FLAG472ceade9 [2021-10-13 06:44:16,860 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/data/9a13a5098/34c2fd5b17484b0b8a612793b0ae5040 [2021-10-13 06:44:16,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:44:16,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:44:16,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:16,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:44:16,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:44:16,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:16" (1/1) ... [2021-10-13 06:44:16,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b9bbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:16, skipping insertion in model container [2021-10-13 06:44:16,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:16" (1/1) ... [2021-10-13 06:44:16,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:44:16,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:44:17,369 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_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-13 06:44:17,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:17,388 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:44:17,510 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_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-13 06:44:17,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:17,528 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:44:17,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17 WrapperNode [2021-10-13 06:44:17,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:17,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:17,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:44:17,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:44:17,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:17,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:44:17,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:44:17,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:44:17,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:44:17,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:44:17,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:44:17,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:44:17,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (1/1) ... [2021-10-13 06:44:17,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:17,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:44:17,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:44:17,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:44:17,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 06:44:18,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:44:18,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:44:18,317 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,341 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,360 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,373 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,374 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,375 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,381 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,392 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,399 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,406 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,406 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,408 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,410 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,413 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,414 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,415 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,418 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,419 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,420 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,420 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,422 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,424 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,427 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,429 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,431 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,434 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,436 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,438 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,438 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:18,440 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 06:44:19,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-10-13 06:44:19,559 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-10-13 06:44:19,559 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-10-13 06:44:19,559 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-10-13 06:44:19,560 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-13 06:44:19,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-13 06:44:19,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-13 06:44:19,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-13 06:44:19,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-10-13 06:44:19,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-10-13 06:44:19,562 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-10-13 06:44:19,562 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-10-13 06:44:19,562 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-13 06:44:19,563 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-13 06:44:19,563 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-10-13 06:44:19,563 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-13 06:44:19,563 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-13 06:44:19,564 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-10-13 06:44:19,564 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-10-13 06:44:19,564 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-10-13 06:44:19,564 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-10-13 06:44:19,565 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-10-13 06:44:19,566 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-10-13 06:44:19,566 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-13 06:44:19,566 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-13 06:44:19,566 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-10-13 06:44:19,566 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-10-13 06:44:19,566 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-10-13 06:44:19,567 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-10-13 06:44:19,568 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-10-13 06:44:19,568 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-13 06:44:19,568 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-13 06:44:19,568 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-10-13 06:44:19,570 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-10-13 06:44:19,570 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-10-13 06:44:19,570 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-10-13 06:44:19,570 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-10-13 06:44:19,571 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-10-13 06:44:19,571 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-10-13 06:44:19,571 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-10-13 06:44:20,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:44:20,820 INFO L299 CfgBuilder]: Removed 275 assume(true) statements. [2021-10-13 06:44:20,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:20 BoogieIcfgContainer [2021-10-13 06:44:20,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:44:20,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:44:20,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:44:20,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:44:20,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:44:16" (1/3) ... [2021-10-13 06:44:20,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7b3d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:20, skipping insertion in model container [2021-10-13 06:44:20,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:17" (2/3) ... [2021-10-13 06:44:20,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7b3d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:20, skipping insertion in model container [2021-10-13 06:44:20,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:20" (3/3) ... [2021-10-13 06:44:20,833 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-13 06:44:20,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:44:20,839 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2021-10-13 06:44:20,890 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:44:20,896 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, mConcurrency=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-13 06:44:20,897 INFO L340 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2021-10-13 06:44:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 297 states have (on average 1.7744107744107744) internal successors, (527), 350 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 06:44:20,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:20,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 06:44:20,927 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 3916932, now seen corresponding path program 1 times [2021-10-13 06:44:20,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:20,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716862566] [2021-10-13 06:44:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:20,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:21,132 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-13 06:44:21,133 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:21,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716862566] [2021-10-13 06:44:21,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716862566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:21,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:21,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:21,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669264306] [2021-10-13 06:44:21,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:21,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:21,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:21,159 INFO L87 Difference]: Start difference. First operand has 351 states, 297 states have (on average 1.7744107744107744) internal successors, (527), 350 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:21,458 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2021-10-13 06:44:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 06:44:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:21,483 INFO L225 Difference]: With dead ends: 637 [2021-10-13 06:44:21,484 INFO L226 Difference]: Without dead ends: 359 [2021-10-13 06:44:21,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-10-13 06:44:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2021-10-13 06:44:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 308 states have (on average 1.5064935064935066) internal successors, (464), 341 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2021-10-13 06:44:21,590 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2021-10-13 06:44:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:21,591 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2021-10-13 06:44:21,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2021-10-13 06:44:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 06:44:21,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:21,593 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:21,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 06:44:21,594 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1581488811, now seen corresponding path program 1 times [2021-10-13 06:44:21,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:21,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303969855] [2021-10-13 06:44:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:21,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:21,666 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-13 06:44:21,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:21,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303969855] [2021-10-13 06:44:21,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303969855] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:21,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:21,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:21,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997381310] [2021-10-13 06:44:21,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:21,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:21,670 INFO L87 Difference]: Start difference. First operand 342 states and 464 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:21,698 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2021-10-13 06:44:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:21,699 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-13 06:44:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:21,702 INFO L225 Difference]: With dead ends: 378 [2021-10-13 06:44:21,702 INFO L226 Difference]: Without dead ends: 358 [2021-10-13 06:44:21,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-13 06:44:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2021-10-13 06:44:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 319 states have (on average 1.5015673981191222) internal successors, (479), 352 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 479 transitions. [2021-10-13 06:44:21,722 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 479 transitions. Word has length 10 [2021-10-13 06:44:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:21,722 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 479 transitions. [2021-10-13 06:44:21,722 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-13 06:44:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 479 transitions. [2021-10-13 06:44:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 06:44:21,724 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:21,724 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:21,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 06:44:21,725 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1365717038, now seen corresponding path program 1 times [2021-10-13 06:44:21,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:21,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938978385] [2021-10-13 06:44:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:21,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:21,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:21,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938978385] [2021-10-13 06:44:21,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938978385] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:21,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:21,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:21,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188106902] [2021-10-13 06:44:21,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:21,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:21,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:21,848 INFO L87 Difference]: Start difference. First operand 353 states and 479 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:21,884 INFO L93 Difference]: Finished difference Result 431 states and 575 transitions. [2021-10-13 06:44:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:21,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 06:44:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:21,888 INFO L225 Difference]: With dead ends: 431 [2021-10-13 06:44:21,889 INFO L226 Difference]: Without dead ends: 397 [2021-10-13 06:44:21,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-13 06:44:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 373. [2021-10-13 06:44:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 342 states have (on average 1.4883040935672514) internal successors, (509), 372 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 509 transitions. [2021-10-13 06:44:21,909 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 509 transitions. Word has length 11 [2021-10-13 06:44:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:21,909 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 509 transitions. [2021-10-13 06:44:21,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 509 transitions. [2021-10-13 06:44:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 06:44:21,912 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:21,912 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:21,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 06:44:21,913 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash -698114258, now seen corresponding path program 1 times [2021-10-13 06:44:21,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:21,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802157070] [2021-10-13 06:44:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:21,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,026 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-13 06:44:22,026 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802157070] [2021-10-13 06:44:22,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802157070] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:22,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782317508] [2021-10-13 06:44:22,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:22,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:22,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,029 INFO L87 Difference]: Start difference. First operand 373 states and 509 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:22,099 INFO L93 Difference]: Finished difference Result 611 states and 816 transitions. [2021-10-13 06:44:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:22,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 06:44:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:22,102 INFO L225 Difference]: With dead ends: 611 [2021-10-13 06:44:22,103 INFO L226 Difference]: Without dead ends: 435 [2021-10-13 06:44:22,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-13 06:44:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 351. [2021-10-13 06:44:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 330 states have (on average 1.4393939393939394) internal successors, (475), 350 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2021-10-13 06:44:22,127 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 12 [2021-10-13 06:44:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:22,127 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2021-10-13 06:44:22,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2021-10-13 06:44:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 06:44:22,133 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:22,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:22,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 06:44:22,163 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 968473548, now seen corresponding path program 1 times [2021-10-13 06:44:22,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:22,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47364412] [2021-10-13 06:44:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:22,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,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-13 06:44:22,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47364412] [2021-10-13 06:44:22,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47364412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:22,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719643082] [2021-10-13 06:44:22,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:22,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,199 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:22,348 INFO L93 Difference]: Finished difference Result 375 states and 503 transitions. [2021-10-13 06:44:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:22,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 06:44:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:22,351 INFO L225 Difference]: With dead ends: 375 [2021-10-13 06:44:22,352 INFO L226 Difference]: Without dead ends: 357 [2021-10-13 06:44:22,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-13 06:44:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-13 06:44:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 336 states have (on average 1.4285714285714286) internal successors, (480), 356 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2021-10-13 06:44:22,371 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 14 [2021-10-13 06:44:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:22,371 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2021-10-13 06:44:22,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2021-10-13 06:44:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 06:44:22,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:22,373 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:22,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 06:44:22,374 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1947817000, now seen corresponding path program 1 times [2021-10-13 06:44:22,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:22,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578621295] [2021-10-13 06:44:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:22,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,414 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-13 06:44:22,414 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578621295] [2021-10-13 06:44:22,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578621295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:22,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005465889] [2021-10-13 06:44:22,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:22,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:22,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,417 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:22,558 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2021-10-13 06:44:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:22,558 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-13 06:44:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:22,561 INFO L225 Difference]: With dead ends: 357 [2021-10-13 06:44:22,561 INFO L226 Difference]: Without dead ends: 341 [2021-10-13 06:44:22,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-13 06:44:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-10-13 06:44:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 328 states have (on average 1.4115853658536586) internal successors, (463), 340 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2021-10-13 06:44:22,581 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2021-10-13 06:44:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:22,581 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2021-10-13 06:44:22,581 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-13 06:44:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2021-10-13 06:44:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:44:22,583 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:22,583 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:22,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 06:44:22,583 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 670796967, now seen corresponding path program 1 times [2021-10-13 06:44:22,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:22,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007007227] [2021-10-13 06:44:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:22,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,628 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-13 06:44:22,628 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007007227] [2021-10-13 06:44:22,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007007227] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:22,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284439757] [2021-10-13 06:44:22,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:22,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:22,631 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:22,680 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2021-10-13 06:44:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:22,681 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-13 06:44:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:22,684 INFO L225 Difference]: With dead ends: 425 [2021-10-13 06:44:22,684 INFO L226 Difference]: Without dead ends: 389 [2021-10-13 06:44:22,685 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-10-13 06:44:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 328. [2021-10-13 06:44:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 315 states have (on average 1.4063492063492065) internal successors, (443), 327 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 443 transitions. [2021-10-13 06:44:22,703 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 443 transitions. Word has length 19 [2021-10-13 06:44:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:22,704 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 443 transitions. [2021-10-13 06:44:22,704 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-13 06:44:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 443 transitions. [2021-10-13 06:44:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 06:44:22,705 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:22,705 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:22,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 06:44:22,706 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash 276863221, now seen corresponding path program 1 times [2021-10-13 06:44:22,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:22,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020323621] [2021-10-13 06:44:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:22,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,745 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-13 06:44:22,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020323621] [2021-10-13 06:44:22,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020323621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:22,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79539659] [2021-10-13 06:44:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:22,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,748 INFO L87 Difference]: Start difference. First operand 328 states and 443 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:22,872 INFO L93 Difference]: Finished difference Result 428 states and 576 transitions. [2021-10-13 06:44:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:22,872 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-13 06:44:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:22,875 INFO L225 Difference]: With dead ends: 428 [2021-10-13 06:44:22,875 INFO L226 Difference]: Without dead ends: 325 [2021-10-13 06:44:22,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-13 06:44:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-10-13 06:44:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.3980891719745223) internal successors, (439), 324 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 439 transitions. [2021-10-13 06:44:22,912 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 439 transitions. Word has length 20 [2021-10-13 06:44:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:22,913 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 439 transitions. [2021-10-13 06:44:22,913 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-13 06:44:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 439 transitions. [2021-10-13 06:44:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 06:44:22,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:22,915 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:22,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 06:44:22,915 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1071552806, now seen corresponding path program 1 times [2021-10-13 06:44:22,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:22,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895091451] [2021-10-13 06:44:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:22,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,973 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-13 06:44:22,973 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895091451] [2021-10-13 06:44:22,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895091451] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:22,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617097327] [2021-10-13 06:44:22,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:22,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:22,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:22,976 INFO L87 Difference]: Start difference. First operand 325 states and 439 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,153 INFO L93 Difference]: Finished difference Result 330 states and 443 transitions. [2021-10-13 06:44:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:23,153 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-13 06:44:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,156 INFO L225 Difference]: With dead ends: 330 [2021-10-13 06:44:23,156 INFO L226 Difference]: Without dead ends: 325 [2021-10-13 06:44:23,156 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-13 06:44:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-10-13 06:44:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 314 states have (on average 1.394904458598726) internal successors, (438), 324 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 438 transitions. [2021-10-13 06:44:23,179 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 438 transitions. Word has length 20 [2021-10-13 06:44:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,180 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 438 transitions. [2021-10-13 06:44:23,180 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-13 06:44:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 438 transitions. [2021-10-13 06:44:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 06:44:23,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,182 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 06:44:23,182 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2030436846, now seen corresponding path program 1 times [2021-10-13 06:44:23,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735447348] [2021-10-13 06:44:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,216 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-13 06:44:23,216 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735447348] [2021-10-13 06:44:23,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735447348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:23,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235304823] [2021-10-13 06:44:23,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:23,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:23,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:23,219 INFO L87 Difference]: Start difference. First operand 325 states and 438 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,261 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2021-10-13 06:44:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:23,262 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-13 06:44:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,264 INFO L225 Difference]: With dead ends: 418 [2021-10-13 06:44:23,264 INFO L226 Difference]: Without dead ends: 323 [2021-10-13 06:44:23,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-13 06:44:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2021-10-13 06:44:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 298 states have (on average 1.3791946308724832) internal successors, (411), 308 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2021-10-13 06:44:23,288 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 21 [2021-10-13 06:44:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,288 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2021-10-13 06:44:23,289 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-13 06:44:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2021-10-13 06:44:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 06:44:23,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 06:44:23,291 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash 612333619, now seen corresponding path program 1 times [2021-10-13 06:44:23,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555264009] [2021-10-13 06:44:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:23,344 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555264009] [2021-10-13 06:44:23,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555264009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:23,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128856951] [2021-10-13 06:44:23,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:23,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:23,347 INFO L87 Difference]: Start difference. First operand 309 states and 411 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,525 INFO L93 Difference]: Finished difference Result 314 states and 415 transitions. [2021-10-13 06:44:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 06:44:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,528 INFO L225 Difference]: With dead ends: 314 [2021-10-13 06:44:23,528 INFO L226 Difference]: Without dead ends: 309 [2021-10-13 06:44:23,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-10-13 06:44:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-10-13 06:44:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 298 states have (on average 1.3758389261744965) internal successors, (410), 308 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 410 transitions. [2021-10-13 06:44:23,553 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 410 transitions. Word has length 21 [2021-10-13 06:44:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,554 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 410 transitions. [2021-10-13 06:44:23,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 410 transitions. [2021-10-13 06:44:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 06:44:23,555 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 06:44:23,556 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1058451947, now seen corresponding path program 1 times [2021-10-13 06:44:23,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819784543] [2021-10-13 06:44:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:23,606 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819784543] [2021-10-13 06:44:23,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819784543] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:23,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795333742] [2021-10-13 06:44:23,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:23,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:23,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:23,609 INFO L87 Difference]: Start difference. First operand 309 states and 410 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,651 INFO L93 Difference]: Finished difference Result 349 states and 455 transitions. [2021-10-13 06:44:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:23,651 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-13 06:44:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,654 INFO L225 Difference]: With dead ends: 349 [2021-10-13 06:44:23,654 INFO L226 Difference]: Without dead ends: 295 [2021-10-13 06:44:23,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-13 06:44:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2021-10-13 06:44:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.3652482269503545) internal successors, (385), 292 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2021-10-13 06:44:23,682 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 21 [2021-10-13 06:44:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,683 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2021-10-13 06:44:23,683 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-13 06:44:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2021-10-13 06:44:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 06:44:23,685 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,685 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 06:44:23,685 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash -420836383, now seen corresponding path program 1 times [2021-10-13 06:44:23,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563969051] [2021-10-13 06:44:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:23,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563969051] [2021-10-13 06:44:23,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563969051] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:23,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325950984] [2021-10-13 06:44:23,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:23,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:23,721 INFO L87 Difference]: Start difference. First operand 293 states and 385 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,889 INFO L93 Difference]: Finished difference Result 344 states and 448 transitions. [2021-10-13 06:44:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:23,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 06:44:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,892 INFO L225 Difference]: With dead ends: 344 [2021-10-13 06:44:23,892 INFO L226 Difference]: Without dead ends: 336 [2021-10-13 06:44:23,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-13 06:44:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2021-10-13 06:44:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.3689655172413793) internal successors, (397), 300 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2021-10-13 06:44:23,923 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 22 [2021-10-13 06:44:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,924 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2021-10-13 06:44:23,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2021-10-13 06:44:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 06:44:23,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 06:44:23,927 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1442209585, now seen corresponding path program 1 times [2021-10-13 06:44:23,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119912871] [2021-10-13 06:44:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,964 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-13 06:44:23,965 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119912871] [2021-10-13 06:44:23,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119912871] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:23,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959807639] [2021-10-13 06:44:23,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:23,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:23,968 INFO L87 Difference]: Start difference. First operand 301 states and 397 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,018 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2021-10-13 06:44:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 06:44:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,022 INFO L225 Difference]: With dead ends: 314 [2021-10-13 06:44:24,022 INFO L226 Difference]: Without dead ends: 299 [2021-10-13 06:44:24,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-13 06:44:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-13 06:44:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.3680555555555556) internal successors, (394), 298 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 394 transitions. [2021-10-13 06:44:24,047 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 394 transitions. Word has length 22 [2021-10-13 06:44:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,047 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 394 transitions. [2021-10-13 06:44:24,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 394 transitions. [2021-10-13 06:44:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 06:44:24,049 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,049 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 06:44:24,050 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash 375582176, now seen corresponding path program 1 times [2021-10-13 06:44:24,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852522595] [2021-10-13 06:44:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,091 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-13 06:44:24,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852522595] [2021-10-13 06:44:24,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852522595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:24,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60684012] [2021-10-13 06:44:24,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:24,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:24,094 INFO L87 Difference]: Start difference. First operand 299 states and 394 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,148 INFO L93 Difference]: Finished difference Result 337 states and 433 transitions. [2021-10-13 06:44:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 06:44:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,151 INFO L225 Difference]: With dead ends: 337 [2021-10-13 06:44:24,151 INFO L226 Difference]: Without dead ends: 316 [2021-10-13 06:44:24,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-13 06:44:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2021-10-13 06:44:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.3655172413793104) internal successors, (396), 300 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 396 transitions. [2021-10-13 06:44:24,176 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 396 transitions. Word has length 22 [2021-10-13 06:44:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,176 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 396 transitions. [2021-10-13 06:44:24,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 396 transitions. [2021-10-13 06:44:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 06:44:24,178 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,178 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 06:44:24,178 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash 638524463, now seen corresponding path program 1 times [2021-10-13 06:44:24,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349594432] [2021-10-13 06:44:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,217 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-13 06:44:24,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349594432] [2021-10-13 06:44:24,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349594432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:24,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051030595] [2021-10-13 06:44:24,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:24,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:24,221 INFO L87 Difference]: Start difference. First operand 301 states and 396 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,288 INFO L93 Difference]: Finished difference Result 314 states and 408 transitions. [2021-10-13 06:44:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:24,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 06:44:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,291 INFO L225 Difference]: With dead ends: 314 [2021-10-13 06:44:24,291 INFO L226 Difference]: Without dead ends: 299 [2021-10-13 06:44:24,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-10-13 06:44:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-10-13 06:44:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.3645833333333333) internal successors, (393), 298 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2021-10-13 06:44:24,313 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 22 [2021-10-13 06:44:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,314 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2021-10-13 06:44:24,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2021-10-13 06:44:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 06:44:24,315 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 06:44:24,316 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash -168683918, now seen corresponding path program 1 times [2021-10-13 06:44:24,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336738798] [2021-10-13 06:44:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,360 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-13 06:44:24,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336738798] [2021-10-13 06:44:24,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336738798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:24,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140435521] [2021-10-13 06:44:24,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:24,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:24,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:24,363 INFO L87 Difference]: Start difference. First operand 299 states and 393 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,548 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2021-10-13 06:44:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:24,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 06:44:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,551 INFO L225 Difference]: With dead ends: 341 [2021-10-13 06:44:24,552 INFO L226 Difference]: Without dead ends: 314 [2021-10-13 06:44:24,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-13 06:44:24,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2021-10-13 06:44:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 284 states have (on average 1.3556338028169015) internal successors, (385), 293 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2021-10-13 06:44:24,576 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 23 [2021-10-13 06:44:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,576 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2021-10-13 06:44:24,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2021-10-13 06:44:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 06:44:24,578 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,578 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 06:44:24,578 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -130301320, now seen corresponding path program 1 times [2021-10-13 06:44:24,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84695249] [2021-10-13 06:44:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:24,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84695249] [2021-10-13 06:44:24,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84695249] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:24,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972303720] [2021-10-13 06:44:24,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:24,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:24,616 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,657 INFO L93 Difference]: Finished difference Result 411 states and 527 transitions. [2021-10-13 06:44:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:24,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 06:44:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,660 INFO L225 Difference]: With dead ends: 411 [2021-10-13 06:44:24,660 INFO L226 Difference]: Without dead ends: 317 [2021-10-13 06:44:24,661 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-13 06:44:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2021-10-13 06:44:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 281 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 367 transitions. [2021-10-13 06:44:24,684 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 367 transitions. Word has length 23 [2021-10-13 06:44:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,684 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 367 transitions. [2021-10-13 06:44:24,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 367 transitions. [2021-10-13 06:44:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:24,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,686 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 06:44:24,686 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash -662751181, now seen corresponding path program 1 times [2021-10-13 06:44:24,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490000576] [2021-10-13 06:44:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,795 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-13 06:44:24,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490000576] [2021-10-13 06:44:24,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490000576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:24,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750218700] [2021-10-13 06:44:24,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:24,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:24,798 INFO L87 Difference]: Start difference. First operand 282 states and 367 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,870 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2021-10-13 06:44:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:24,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,873 INFO L225 Difference]: With dead ends: 382 [2021-10-13 06:44:24,873 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 06:44:24,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 06:44:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 270. [2021-10-13 06:44:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.321969696969697) internal successors, (349), 269 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2021-10-13 06:44:24,905 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 24 [2021-10-13 06:44:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,905 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2021-10-13 06:44:24,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2021-10-13 06:44:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:24,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,907 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 06:44:24,908 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1269559156, now seen corresponding path program 1 times [2021-10-13 06:44:24,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654917882] [2021-10-13 06:44:24,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,954 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-13 06:44:24,954 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654917882] [2021-10-13 06:44:24,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654917882] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:24,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211820655] [2021-10-13 06:44:24,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:24,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:24,957 INFO L87 Difference]: Start difference. First operand 270 states and 349 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:25,124 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2021-10-13 06:44:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:25,127 INFO L225 Difference]: With dead ends: 360 [2021-10-13 06:44:25,127 INFO L226 Difference]: Without dead ends: 340 [2021-10-13 06:44:25,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-13 06:44:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-10-13 06:44:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 280 states have (on average 1.3035714285714286) internal successors, (365), 285 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 365 transitions. [2021-10-13 06:44:25,157 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 365 transitions. Word has length 24 [2021-10-13 06:44:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:25,157 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 365 transitions. [2021-10-13 06:44:25,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 365 transitions. [2021-10-13 06:44:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:25,159 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:25,159 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:25,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 06:44:25,159 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1364391258, now seen corresponding path program 1 times [2021-10-13 06:44:25,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:25,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759082213] [2021-10-13 06:44:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:25,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:25,201 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-13 06:44:25,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:25,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759082213] [2021-10-13 06:44:25,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759082213] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:25,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:25,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:25,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581231155] [2021-10-13 06:44:25,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:25,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:25,204 INFO L87 Difference]: Start difference. First operand 286 states and 365 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:25,272 INFO L93 Difference]: Finished difference Result 299 states and 377 transitions. [2021-10-13 06:44:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:25,275 INFO L225 Difference]: With dead ends: 299 [2021-10-13 06:44:25,275 INFO L226 Difference]: Without dead ends: 282 [2021-10-13 06:44:25,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-13 06:44:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-10-13 06:44:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.3043478260869565) internal successors, (360), 281 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2021-10-13 06:44:25,305 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 24 [2021-10-13 06:44:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:25,305 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2021-10-13 06:44:25,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2021-10-13 06:44:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 06:44:25,306 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:25,307 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:25,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 06:44:25,307 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash -896029021, now seen corresponding path program 1 times [2021-10-13 06:44:25,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:25,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821087447] [2021-10-13 06:44:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:25,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:25,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-13 06:44:25,352 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:25,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821087447] [2021-10-13 06:44:25,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821087447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:25,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:25,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:25,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939922067] [2021-10-13 06:44:25,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:25,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:25,354 INFO L87 Difference]: Start difference. First operand 282 states and 360 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:25,517 INFO L93 Difference]: Finished difference Result 368 states and 467 transitions. [2021-10-13 06:44:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:25,519 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-13 06:44:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:25,521 INFO L225 Difference]: With dead ends: 368 [2021-10-13 06:44:25,521 INFO L226 Difference]: Without dead ends: 282 [2021-10-13 06:44:25,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-13 06:44:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-10-13 06:44:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2934782608695652) internal successors, (357), 281 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 357 transitions. [2021-10-13 06:44:25,552 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 357 transitions. Word has length 25 [2021-10-13 06:44:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:25,552 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 357 transitions. [2021-10-13 06:44:25,552 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-13 06:44:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 357 transitions. [2021-10-13 06:44:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 06:44:25,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:25,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:25,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 06:44:25,554 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:25,554 INFO L82 PathProgramCache]: Analyzing trace with hash 719084810, now seen corresponding path program 1 times [2021-10-13 06:44:25,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:25,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557411426] [2021-10-13 06:44:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:25,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:25,599 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-13 06:44:25,599 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:25,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557411426] [2021-10-13 06:44:25,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557411426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:25,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:25,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:25,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091479748] [2021-10-13 06:44:25,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:25,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:25,602 INFO L87 Difference]: Start difference. First operand 282 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:25,746 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2021-10-13 06:44:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:25,746 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-13 06:44:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:25,748 INFO L225 Difference]: With dead ends: 287 [2021-10-13 06:44:25,748 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 06:44:25,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 06:44:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-10-13 06:44:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 278 states have (on average 1.29136690647482) internal successors, (359), 283 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2021-10-13 06:44:25,780 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 25 [2021-10-13 06:44:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:25,781 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2021-10-13 06:44:25,781 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-13 06:44:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2021-10-13 06:44:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 06:44:25,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:25,782 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:25,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 06:44:25,783 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 719096726, now seen corresponding path program 1 times [2021-10-13 06:44:25,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:25,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27360333] [2021-10-13 06:44:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:25,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:25,821 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-13 06:44:25,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:25,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27360333] [2021-10-13 06:44:25,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27360333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:25,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:25,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:25,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309421110] [2021-10-13 06:44:25,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:25,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:25,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:25,824 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:26,008 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-10-13 06:44:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:26,009 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-13 06:44:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:26,011 INFO L225 Difference]: With dead ends: 342 [2021-10-13 06:44:26,011 INFO L226 Difference]: Without dead ends: 328 [2021-10-13 06:44:26,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-13 06:44:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2021-10-13 06:44:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2836879432624113) internal successors, (362), 287 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 362 transitions. [2021-10-13 06:44:26,041 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 362 transitions. Word has length 25 [2021-10-13 06:44:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:26,041 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 362 transitions. [2021-10-13 06:44:26,041 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-13 06:44:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 362 transitions. [2021-10-13 06:44:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 06:44:26,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:26,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:26,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 06:44:26,043 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1275592658, now seen corresponding path program 1 times [2021-10-13 06:44:26,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:26,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15959145] [2021-10-13 06:44:26,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:26,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:26,081 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-13 06:44:26,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:26,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15959145] [2021-10-13 06:44:26,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15959145] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:26,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:26,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:26,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66352539] [2021-10-13 06:44:26,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:26,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:26,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:26,084 INFO L87 Difference]: Start difference. First operand 288 states and 362 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:26,234 INFO L93 Difference]: Finished difference Result 337 states and 413 transitions. [2021-10-13 06:44:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:26,234 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-13 06:44:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:26,236 INFO L225 Difference]: With dead ends: 337 [2021-10-13 06:44:26,236 INFO L226 Difference]: Without dead ends: 288 [2021-10-13 06:44:26,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-13 06:44:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-10-13 06:44:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 287 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-10-13 06:44:26,269 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 25 [2021-10-13 06:44:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:26,269 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-10-13 06:44:26,269 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-13 06:44:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-10-13 06:44:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:44:26,270 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:26,271 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:26,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 06:44:26,271 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash 513282031, now seen corresponding path program 1 times [2021-10-13 06:44:26,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:26,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209024662] [2021-10-13 06:44:26,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:26,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:26,328 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-13 06:44:26,329 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:26,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209024662] [2021-10-13 06:44:26,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209024662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:26,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:26,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:26,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525997359] [2021-10-13 06:44:26,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:26,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:26,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:26,332 INFO L87 Difference]: Start difference. First operand 288 states and 354 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:26,573 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-10-13 06:44:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:26,574 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-13 06:44:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:26,576 INFO L225 Difference]: With dead ends: 342 [2021-10-13 06:44:26,576 INFO L226 Difference]: Without dead ends: 338 [2021-10-13 06:44:26,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.2ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-13 06:44:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2021-10-13 06:44:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.2553191489361701) internal successors, (354), 287 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-10-13 06:44:26,609 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 26 [2021-10-13 06:44:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:26,609 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-10-13 06:44:26,609 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-13 06:44:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-10-13 06:44:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:44:26,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:26,611 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:26,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 06:44:26,611 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1329987784, now seen corresponding path program 1 times [2021-10-13 06:44:26,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:26,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852097986] [2021-10-13 06:44:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:26,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:26,690 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-13 06:44:26,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:26,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852097986] [2021-10-13 06:44:26,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852097986] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:26,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:26,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:26,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964280458] [2021-10-13 06:44:26,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:44:26,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:44:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:26,693 INFO L87 Difference]: Start difference. First operand 288 states and 354 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:26,896 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2021-10-13 06:44:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 06:44:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:26,899 INFO L225 Difference]: With dead ends: 321 [2021-10-13 06:44:26,899 INFO L226 Difference]: Without dead ends: 303 [2021-10-13 06:44:26,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 97.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 06:44:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-13 06:44:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2021-10-13 06:44:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.2210144927536233) internal successors, (337), 281 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2021-10-13 06:44:26,939 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 26 [2021-10-13 06:44:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:26,940 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2021-10-13 06:44:26,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2021-10-13 06:44:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:44:26,941 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:26,942 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:26,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 06:44:26,942 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash -937040231, now seen corresponding path program 1 times [2021-10-13 06:44:26,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:26,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705002297] [2021-10-13 06:44:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:26,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:26,974 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-13 06:44:26,975 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:26,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705002297] [2021-10-13 06:44:26,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705002297] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:26,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:26,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:26,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540080101] [2021-10-13 06:44:26,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:26,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:26,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:26,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:26,977 INFO L87 Difference]: Start difference. First operand 282 states and 337 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:27,104 INFO L93 Difference]: Finished difference Result 311 states and 364 transitions. [2021-10-13 06:44:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:27,105 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-13 06:44:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:27,107 INFO L225 Difference]: With dead ends: 311 [2021-10-13 06:44:27,107 INFO L226 Difference]: Without dead ends: 269 [2021-10-13 06:44:27,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-10-13 06:44:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2021-10-13 06:44:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 253 states have (on average 1.225296442687747) internal successors, (310), 258 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2021-10-13 06:44:27,142 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 26 [2021-10-13 06:44:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:27,143 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2021-10-13 06:44:27,143 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-13 06:44:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2021-10-13 06:44:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 06:44:27,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:27,144 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:27,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 06:44:27,145 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1033980549, now seen corresponding path program 1 times [2021-10-13 06:44:27,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:27,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174476410] [2021-10-13 06:44:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:27,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:27,191 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-13 06:44:27,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:27,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174476410] [2021-10-13 06:44:27,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174476410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:27,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:27,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:27,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191405472] [2021-10-13 06:44:27,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:27,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:27,194 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:27,329 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-10-13 06:44:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:27,330 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-13 06:44:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:27,332 INFO L225 Difference]: With dead ends: 266 [2021-10-13 06:44:27,332 INFO L226 Difference]: Without dead ends: 237 [2021-10-13 06:44:27,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-13 06:44:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2021-10-13 06:44:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2378854625550662) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2021-10-13 06:44:27,361 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 27 [2021-10-13 06:44:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:27,362 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2021-10-13 06:44:27,362 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-13 06:44:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2021-10-13 06:44:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 06:44:27,363 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:27,363 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:27,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 06:44:27,364 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash -835413411, now seen corresponding path program 1 times [2021-10-13 06:44:27,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:27,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301498359] [2021-10-13 06:44:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:27,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:27,397 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-13 06:44:27,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:27,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301498359] [2021-10-13 06:44:27,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301498359] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:27,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:27,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:27,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426134599] [2021-10-13 06:44:27,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:27,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:27,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:27,400 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:27,521 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2021-10-13 06:44:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:27,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 06:44:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:27,523 INFO L225 Difference]: With dead ends: 243 [2021-10-13 06:44:27,524 INFO L226 Difference]: Without dead ends: 238 [2021-10-13 06:44:27,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-10-13 06:44:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2021-10-13 06:44:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2334801762114538) internal successors, (280), 232 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-10-13 06:44:27,555 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-10-13 06:44:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:27,555 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-10-13 06:44:27,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-10-13 06:44:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 06:44:27,556 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:27,557 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:27,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 06:44:27,557 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash -336964878, now seen corresponding path program 1 times [2021-10-13 06:44:27,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:27,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838773816] [2021-10-13 06:44:27,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:27,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:27,617 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-13 06:44:27,617 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:27,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838773816] [2021-10-13 06:44:27,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838773816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:27,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:27,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:27,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232011634] [2021-10-13 06:44:27,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:27,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:27,620 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:27,821 INFO L93 Difference]: Finished difference Result 263 states and 314 transitions. [2021-10-13 06:44:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:27,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 06:44:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:27,826 INFO L225 Difference]: With dead ends: 263 [2021-10-13 06:44:27,826 INFO L226 Difference]: Without dead ends: 261 [2021-10-13 06:44:27,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-13 06:44:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2021-10-13 06:44:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 227 states have (on average 1.2334801762114538) internal successors, (280), 232 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-10-13 06:44:27,867 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-10-13 06:44:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:27,867 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-10-13 06:44:27,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-10-13 06:44:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 06:44:27,869 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:27,869 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:27,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 06:44:27,869 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2033165494, now seen corresponding path program 1 times [2021-10-13 06:44:27,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:27,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930280827] [2021-10-13 06:44:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:27,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:27,905 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-13 06:44:27,906 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:27,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930280827] [2021-10-13 06:44:27,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930280827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:27,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:27,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:27,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26346306] [2021-10-13 06:44:27,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:27,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:27,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:27,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:27,909 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:27,986 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2021-10-13 06:44:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:27,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-13 06:44:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:27,989 INFO L225 Difference]: With dead ends: 247 [2021-10-13 06:44:27,989 INFO L226 Difference]: Without dead ends: 226 [2021-10-13 06:44:27,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-13 06:44:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-10-13 06:44:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 220 states have (on average 1.2272727272727273) internal successors, (270), 225 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 270 transitions. [2021-10-13 06:44:28,019 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 270 transitions. Word has length 29 [2021-10-13 06:44:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,020 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 270 transitions. [2021-10-13 06:44:28,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 270 transitions. [2021-10-13 06:44:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 06:44:28,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 06:44:28,022 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash -657637208, now seen corresponding path program 1 times [2021-10-13 06:44:28,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456903844] [2021-10-13 06:44:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,052 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-13 06:44:28,052 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456903844] [2021-10-13 06:44:28,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456903844] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:28,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742908143] [2021-10-13 06:44:28,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:28,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:28,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:28,054 INFO L87 Difference]: Start difference. First operand 226 states and 270 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,180 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2021-10-13 06:44:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-13 06:44:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,182 INFO L225 Difference]: With dead ends: 231 [2021-10-13 06:44:28,182 INFO L226 Difference]: Without dead ends: 213 [2021-10-13 06:44:28,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-13 06:44:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-13 06:44:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 212 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2021-10-13 06:44:28,213 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 29 [2021-10-13 06:44:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,214 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2021-10-13 06:44:28,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2021-10-13 06:44:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 06:44:28,215 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,215 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 06:44:28,216 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1797324549, now seen corresponding path program 1 times [2021-10-13 06:44:28,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091446655] [2021-10-13 06:44:28,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,260 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-13 06:44:28,260 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091446655] [2021-10-13 06:44:28,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091446655] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:28,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674509823] [2021-10-13 06:44:28,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:28,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:28,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:28,263 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,321 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2021-10-13 06:44:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-13 06:44:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,323 INFO L225 Difference]: With dead ends: 237 [2021-10-13 06:44:28,323 INFO L226 Difference]: Without dead ends: 213 [2021-10-13 06:44:28,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-13 06:44:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-13 06:44:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.21256038647343) internal successors, (251), 212 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2021-10-13 06:44:28,351 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 29 [2021-10-13 06:44:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,351 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2021-10-13 06:44:28,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2021-10-13 06:44:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 06:44:28,353 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,353 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 06:44:28,353 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash -505348968, now seen corresponding path program 1 times [2021-10-13 06:44:28,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584009283] [2021-10-13 06:44:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,415 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-13 06:44:28,415 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584009283] [2021-10-13 06:44:28,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584009283] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:28,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035667573] [2021-10-13 06:44:28,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:28,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:28,418 INFO L87 Difference]: Start difference. First operand 213 states and 251 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,556 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2021-10-13 06:44:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 06:44:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,558 INFO L225 Difference]: With dead ends: 234 [2021-10-13 06:44:28,558 INFO L226 Difference]: Without dead ends: 213 [2021-10-13 06:44:28,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-13 06:44:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2021-10-13 06:44:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 197 states have (on average 1.2131979695431472) internal successors, (239), 202 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2021-10-13 06:44:28,588 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 30 [2021-10-13 06:44:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,588 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2021-10-13 06:44:28,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2021-10-13 06:44:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 06:44:28,589 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,589 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 06:44:28,590 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1799897054, now seen corresponding path program 1 times [2021-10-13 06:44:28,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861640674] [2021-10-13 06:44:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,658 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-13 06:44:28,658 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861640674] [2021-10-13 06:44:28,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861640674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:28,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646114229] [2021-10-13 06:44:28,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:28,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:28,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:28,661 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,848 INFO L93 Difference]: Finished difference Result 279 states and 334 transitions. [2021-10-13 06:44:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-13 06:44:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,851 INFO L225 Difference]: With dead ends: 279 [2021-10-13 06:44:28,851 INFO L226 Difference]: Without dead ends: 211 [2021-10-13 06:44:28,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-13 06:44:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2021-10-13 06:44:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.202127659574468) internal successors, (226), 192 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2021-10-13 06:44:28,877 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 30 [2021-10-13 06:44:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,878 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2021-10-13 06:44:28,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2021-10-13 06:44:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 06:44:28,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,879 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 06:44:28,881 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash -138267735, now seen corresponding path program 1 times [2021-10-13 06:44:28,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139671578] [2021-10-13 06:44:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,927 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-13 06:44:28,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139671578] [2021-10-13 06:44:28,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139671578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:28,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174092266] [2021-10-13 06:44:28,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:28,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:28,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:28,931 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,974 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-10-13 06:44:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-13 06:44:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,976 INFO L225 Difference]: With dead ends: 203 [2021-10-13 06:44:28,976 INFO L226 Difference]: Without dead ends: 155 [2021-10-13 06:44:28,976 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-13 06:44:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-10-13 06:44:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 154 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-10-13 06:44:28,998 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 31 [2021-10-13 06:44:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,998 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-10-13 06:44:28,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-10-13 06:44:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 06:44:28,999 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,999 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:29,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 06:44:29,000 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:29,000 INFO L82 PathProgramCache]: Analyzing trace with hash 709117488, now seen corresponding path program 1 times [2021-10-13 06:44:29,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:29,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725280742] [2021-10-13 06:44:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:29,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:29,045 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-13 06:44:29,045 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:29,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725280742] [2021-10-13 06:44:29,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725280742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:29,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:29,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:29,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8494705] [2021-10-13 06:44:29,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:29,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:29,048 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:29,192 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2021-10-13 06:44:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-13 06:44:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:29,194 INFO L225 Difference]: With dead ends: 187 [2021-10-13 06:44:29,194 INFO L226 Difference]: Without dead ends: 163 [2021-10-13 06:44:29,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-13 06:44:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-10-13 06:44:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 147 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2021-10-13 06:44:29,214 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 32 [2021-10-13 06:44:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:29,214 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2021-10-13 06:44:29,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2021-10-13 06:44:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 06:44:29,216 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:29,216 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:29,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 06:44:29,216 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1394718914, now seen corresponding path program 1 times [2021-10-13 06:44:29,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:29,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888243061] [2021-10-13 06:44:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:29,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:29,282 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-13 06:44:29,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:29,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888243061] [2021-10-13 06:44:29,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888243061] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:29,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:29,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:29,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487566237] [2021-10-13 06:44:29,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:44:29,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:44:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:29,285 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:29,503 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2021-10-13 06:44:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:44:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-13 06:44:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:29,505 INFO L225 Difference]: With dead ends: 164 [2021-10-13 06:44:29,505 INFO L226 Difference]: Without dead ends: 118 [2021-10-13 06:44:29,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:44:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-13 06:44:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-10-13 06:44:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.19) internal successors, (119), 101 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-10-13 06:44:29,536 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 33 [2021-10-13 06:44:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:29,536 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-10-13 06:44:29,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-10-13 06:44:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 06:44:29,537 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:29,538 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:29,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 06:44:29,538 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1245231514, now seen corresponding path program 1 times [2021-10-13 06:44:29,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:29,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238719987] [2021-10-13 06:44:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:29,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:29,594 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-13 06:44:29,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:29,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238719987] [2021-10-13 06:44:29,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238719987] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:29,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:29,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:29,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994770199] [2021-10-13 06:44:29,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:29,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:29,596 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:29,702 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2021-10-13 06:44:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:29,703 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-13 06:44:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:29,704 INFO L225 Difference]: With dead ends: 134 [2021-10-13 06:44:29,704 INFO L226 Difference]: Without dead ends: 132 [2021-10-13 06:44:29,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-10-13 06:44:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2021-10-13 06:44:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.19) internal successors, (119), 101 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-10-13 06:44:29,722 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 36 [2021-10-13 06:44:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:29,722 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-10-13 06:44:29,722 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-13 06:44:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-10-13 06:44:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 06:44:29,723 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:29,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:29,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 06:44:29,724 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash 904695418, now seen corresponding path program 1 times [2021-10-13 06:44:29,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:29,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965791035] [2021-10-13 06:44:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:29,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:29,787 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-13 06:44:29,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:29,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965791035] [2021-10-13 06:44:29,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965791035] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:29,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:29,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:44:29,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929837091] [2021-10-13 06:44:29,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 06:44:29,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:29,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 06:44:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:29,790 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:29,921 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2021-10-13 06:44:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 06:44:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-13 06:44:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:29,923 INFO L225 Difference]: With dead ends: 118 [2021-10-13 06:44:29,923 INFO L226 Difference]: Without dead ends: 102 [2021-10-13 06:44:29,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:44:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-13 06:44:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-10-13 06:44:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.18) internal successors, (118), 101 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-10-13 06:44:29,940 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 40 [2021-10-13 06:44:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:29,940 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-10-13 06:44:29,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-10-13 06:44:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 06:44:29,941 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:29,941 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:29,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 06:44:29,942 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash 173896077, now seen corresponding path program 1 times [2021-10-13 06:44:29,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:29,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926604570] [2021-10-13 06:44:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:29,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:29,992 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-13 06:44:29,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:29,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926604570] [2021-10-13 06:44:29,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926604570] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:29,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:29,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:29,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622908221] [2021-10-13 06:44:29,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:44:29,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:44:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:29,994 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:30,106 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2021-10-13 06:44:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:30,107 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-13 06:44:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:30,108 INFO L225 Difference]: With dead ends: 129 [2021-10-13 06:44:30,108 INFO L226 Difference]: Without dead ends: 111 [2021-10-13 06:44:30,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:44:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-13 06:44:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-10-13 06:44:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 108 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2021-10-13 06:44:30,134 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 40 [2021-10-13 06:44:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:30,135 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2021-10-13 06:44:30,136 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-13 06:44:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2021-10-13 06:44:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 06:44:30,137 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:30,137 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:30,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 06:44:30,137 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1032182008, now seen corresponding path program 1 times [2021-10-13 06:44:30,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:30,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641536910] [2021-10-13 06:44:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:30,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:30,214 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-13 06:44:30,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:30,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641536910] [2021-10-13 06:44:30,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641536910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:30,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:30,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:30,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829386153] [2021-10-13 06:44:30,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:30,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:30,218 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:30,321 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2021-10-13 06:44:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-13 06:44:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:30,326 INFO L225 Difference]: With dead ends: 168 [2021-10-13 06:44:30,326 INFO L226 Difference]: Without dead ends: 116 [2021-10-13 06:44:30,327 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-13 06:44:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2021-10-13 06:44:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-10-13 06:44:30,343 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2021-10-13 06:44:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:30,343 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-10-13 06:44:30,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-10-13 06:44:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 06:44:30,344 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:30,345 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:30,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 06:44:30,345 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1597143897, now seen corresponding path program 1 times [2021-10-13 06:44:30,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:30,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732556061] [2021-10-13 06:44:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:30,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:30,394 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-13 06:44:30,394 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:30,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732556061] [2021-10-13 06:44:30,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732556061] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:30,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:30,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:30,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453839819] [2021-10-13 06:44:30,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:44:30,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:30,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:44:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:30,397 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:30,476 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-10-13 06:44:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:44:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-13 06:44:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:30,477 INFO L225 Difference]: With dead ends: 101 [2021-10-13 06:44:30,477 INFO L226 Difference]: Without dead ends: 65 [2021-10-13 06:44:30,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 06:44:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-13 06:44:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-13 06:44:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-10-13 06:44:30,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 43 [2021-10-13 06:44:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:30,491 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-10-13 06:44:30,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-10-13 06:44:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 06:44:30,494 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:30,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:30,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-13 06:44:30,496 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:30,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1037680409, now seen corresponding path program 1 times [2021-10-13 06:44:30,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:30,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643529589] [2021-10-13 06:44:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:30,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:30,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:30,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643529589] [2021-10-13 06:44:30,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643529589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:30,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:30,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:30,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847920746] [2021-10-13 06:44:30,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:30,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:30,542 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:30,648 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2021-10-13 06:44:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-13 06:44:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:30,650 INFO L225 Difference]: With dead ends: 93 [2021-10-13 06:44:30,650 INFO L226 Difference]: Without dead ends: 65 [2021-10-13 06:44:30,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-13 06:44:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-13 06:44:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-10-13 06:44:30,661 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2021-10-13 06:44:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:30,662 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-10-13 06:44:30,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-10-13 06:44:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 06:44:30,666 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:30,666 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:30,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-13 06:44:30,667 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:30,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1050287321, now seen corresponding path program 1 times [2021-10-13 06:44:30,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:30,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14668775] [2021-10-13 06:44:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:30,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:30,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-13 06:44:30,763 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:30,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14668775] [2021-10-13 06:44:30,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14668775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:30,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:30,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:30,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147777127] [2021-10-13 06:44:30,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 06:44:30,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 06:44:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:30,765 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:30,846 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-10-13 06:44:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 06:44:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:30,847 INFO L225 Difference]: With dead ends: 83 [2021-10-13 06:44:30,847 INFO L226 Difference]: Without dead ends: 65 [2021-10-13 06:44:30,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:44:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-13 06:44:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-10-13 06:44:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-10-13 06:44:30,862 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 52 [2021-10-13 06:44:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:30,863 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-10-13 06:44:30,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-10-13 06:44:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 06:44:30,864 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:30,864 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:30,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-13 06:44:30,864 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1433729709, now seen corresponding path program 1 times [2021-10-13 06:44:30,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:30,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101584921] [2021-10-13 06:44:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:30,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:31,012 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-13 06:44:31,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:31,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101584921] [2021-10-13 06:44:31,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101584921] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:31,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:31,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 06:44:31,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133715745] [2021-10-13 06:44:31,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 06:44:31,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 06:44:31,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-13 06:44:31,015 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:31,307 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-10-13 06:44:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 06:44:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-13 06:44:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:31,309 INFO L225 Difference]: With dead ends: 110 [2021-10-13 06:44:31,309 INFO L226 Difference]: Without dead ends: 62 [2021-10-13 06:44:31,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 190.6ms TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-10-13 06:44:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-13 06:44:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-13 06:44:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-10-13 06:44:31,324 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 54 [2021-10-13 06:44:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:31,325 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-10-13 06:44:31,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-10-13 06:44:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-13 06:44:31,326 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:31,326 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:31,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-13 06:44:31,326 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 50 more)] === [2021-10-13 06:44:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash -481267565, now seen corresponding path program 1 times [2021-10-13 06:44:31,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:31,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112194394] [2021-10-13 06:44:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:31,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:31,458 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-13 06:44:31,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:31,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112194394] [2021-10-13 06:44:31,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112194394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:31,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:31,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 06:44:31,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662079978] [2021-10-13 06:44:31,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 06:44:31,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 06:44:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 06:44:31,461 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:31,679 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2021-10-13 06:44:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 06:44:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-10-13 06:44:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:31,680 INFO L225 Difference]: With dead ends: 77 [2021-10-13 06:44:31,680 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 06:44:31,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 170.0ms TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-10-13 06:44:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 06:44:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 06:44:31,681 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-13 06:44:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 06:44:31,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2021-10-13 06:44:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:31,681 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 06:44:31,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 06:44:31,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 06:44:31,684 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,687 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,691 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,693 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,694 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,695 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,696 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,698 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,698 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,698 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,698 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,699 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,699 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,699 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,700 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,700 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,700 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,700 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,700 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,701 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,701 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,701 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,701 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,702 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,702 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,702 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,702 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,702 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,703 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,703 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:44:31,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-13 06:44:31,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 06:44:31,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:31,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:32,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:33,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:43,834 INFO L857 garLoopResultBuilder]: For program point L1026-2(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,834 INFO L857 garLoopResultBuilder]: For program point L1026-4(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,834 INFO L857 garLoopResultBuilder]: For program point L1026-6(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,834 INFO L857 garLoopResultBuilder]: For program point L1026-8(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,834 INFO L857 garLoopResultBuilder]: For program point L1026-10(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,835 INFO L857 garLoopResultBuilder]: For program point L1026-12(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,835 INFO L857 garLoopResultBuilder]: For program point L1026-14(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,835 INFO L857 garLoopResultBuilder]: For program point L1026-16(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,835 INFO L857 garLoopResultBuilder]: For program point L1026-18(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,835 INFO L857 garLoopResultBuilder]: For program point L1026-20(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,835 INFO L857 garLoopResultBuilder]: For program point L236-1(lines 229 417) no Hoare annotation was computed. [2021-10-13 06:44:43,836 INFO L857 garLoopResultBuilder]: For program point L1297(lines 1297 1311) no Hoare annotation was computed. [2021-10-13 06:44:43,836 INFO L857 garLoopResultBuilder]: For program point L240(lines 240 246) no Hoare annotation was computed. [2021-10-13 06:44:43,836 INFO L857 garLoopResultBuilder]: For program point L637(lines 637 642) no Hoare annotation was computed. [2021-10-13 06:44:43,836 INFO L857 garLoopResultBuilder]: For program point L637-2(lines 637 642) no Hoare annotation was computed. [2021-10-13 06:44:43,838 INFO L853 garLoopResultBuilder]: At program point L1562(lines 1183 1564) the Hoare annotation is: (let ((.cse13 (= ~pended~0 1)) (.cse7 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (<= 7 ~IPC~0)) (.cse9 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse11 (= 2 ~DC~0)) (.cse14 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse10 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse5 (= ~pended~0 0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse2 (= ~IPC~0 ~s~0) .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse10 .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse2 .cse3 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse14 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse12 .cse5 .cse6) (and .cse0 .cse11 .cse13 .cse2 .cse4 (= ~s~0 ~NP~0) .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse14 .cse12 (<= 4 ~SKIP2~0) .cse5 .cse6 (= ~SKIP2~0 ~s~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5 .cse6))) [2021-10-13 06:44:43,838 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1304) no Hoare annotation was computed. [2021-10-13 06:44:43,838 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,839 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,839 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-13 06:44:43,839 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-13 06:44:43,839 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,839 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,839 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 383) no Hoare annotation was computed. [2021-10-13 06:44:43,840 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,840 INFO L853 garLoopResultBuilder]: At program point L644(lines 612 646) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (<= ULTIMATE.start_main_~status~1 258)) (.cse3 (= 2 ~DC~0)) (.cse4 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2021-10-13 06:44:43,840 INFO L857 garLoopResultBuilder]: For program point L512(lines 512 517) no Hoare annotation was computed. [2021-10-13 06:44:43,840 INFO L853 garLoopResultBuilder]: At program point L512-2(lines 512 517) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,841 INFO L853 garLoopResultBuilder]: At program point L118(lines 118 148) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,841 INFO L857 garLoopResultBuilder]: For program point L118-2(lines 110 158) no Hoare annotation was computed. [2021-10-13 06:44:43,841 INFO L857 garLoopResultBuilder]: For program point L1043(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,841 INFO L853 garLoopResultBuilder]: At program point L118-3(lines 118 148) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,841 INFO L857 garLoopResultBuilder]: For program point L1043-2(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,842 INFO L857 garLoopResultBuilder]: For program point L118-5(lines 110 158) no Hoare annotation was computed. [2021-10-13 06:44:43,842 INFO L857 garLoopResultBuilder]: For program point L1043-4(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,842 INFO L857 garLoopResultBuilder]: For program point L1043-6(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,844 INFO L857 garLoopResultBuilder]: For program point L1043-8(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,844 INFO L857 garLoopResultBuilder]: For program point L1043-10(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,844 INFO L857 garLoopResultBuilder]: For program point L1043-12(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,845 INFO L857 garLoopResultBuilder]: For program point L1043-14(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,845 INFO L857 garLoopResultBuilder]: For program point L1043-16(lines 1043 1049) no Hoare annotation was computed. [2021-10-13 06:44:43,845 INFO L857 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2021-10-13 06:44:43,845 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,845 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,846 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,846 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,846 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,846 INFO L853 garLoopResultBuilder]: At program point L787(lines 780 835) the Hoare annotation is: (let ((.cse18 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse20 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= 4 ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= 7 ~IPC~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse7 (= 2 ~DC~0)) (.cse21 (= ~pended~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse23 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (= ~pended~0 0)) (.cse22 (= ~compRegistered~0 0))) (or (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse6 .cse1 .cse7 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse5 .cse13 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse7 .cse17 .cse18 .cse19 .cse5) (and .cse15 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 (or .cse20 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse11 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse19 .cse5) (and .cse0 .cse1 .cse7 .cse21 .cse4 .cse18 .cse22) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse22) (and .cse14 .cse15 .cse16 .cse1 .cse7 .cse17 .cse11 .cse19 .cse12 .cse5 .cse13) (and .cse23 .cse0 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5) (and .cse6 .cse15 .cse0 .cse20 .cse1 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8 .cse3 .cse9 .cse4 .cse10 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse19 .cse12 .cse5) (and .cse14 .cse15 .cse0 .cse1 .cse7 .cse21 .cse11 .cse19 .cse22 .cse13) (and .cse23 .cse0 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4 .cse5) (and .cse2 (= ULTIMATE.start_main_~status~1 0) .cse5 .cse22))) [2021-10-13 06:44:43,847 INFO L853 garLoopResultBuilder]: At program point L1316(lines 1316 1550) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,847 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 291) no Hoare annotation was computed. [2021-10-13 06:44:43,847 INFO L857 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2021-10-13 06:44:43,847 INFO L853 garLoopResultBuilder]: At program point L129(lines 129 136) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,847 INFO L853 garLoopResultBuilder]: At program point L129-1(lines 129 136) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,848 INFO L857 garLoopResultBuilder]: For program point L1452(lines 1452 1455) no Hoare annotation was computed. [2021-10-13 06:44:43,849 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,850 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 593) no Hoare annotation was computed. [2021-10-13 06:44:43,850 INFO L857 garLoopResultBuilder]: For program point L528-1(lines 528 593) no Hoare annotation was computed. [2021-10-13 06:44:43,850 INFO L853 garLoopResultBuilder]: At program point L1321(lines 1321 1548) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,850 INFO L857 garLoopResultBuilder]: For program point L530(lines 530 570) no Hoare annotation was computed. [2021-10-13 06:44:43,851 INFO L853 garLoopResultBuilder]: At program point L795(lines 788 834) the Hoare annotation is: (let ((.cse0 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse7 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse10 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse9 (= 2 ~DC~0)) (.cse11 (= ~IPC~0 ~s~0)) (.cse21 (not (= ~MPR3~0 ~s~0))) (.cse20 (= ~pended~0 1)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse6 (<= 7 ~IPC~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse22 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= ~s~0 ~DC~0)) (.cse17 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (= 2 ~s~0)) (.cse18 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (not (= ~IPC~0 2))) (.cse19 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse12 .cse14 .cse15) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse16 .cse8 .cse9 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse17 .cse18 .cse19 .cse13 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse14 .cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse8 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse5 .cse6 .cse1 .cse8 .cse9 .cse20 .cse13 .cse12 .cse15 .cse21) (and .cse1 .cse8 .cse9 .cse20 .cse4 .cse11 .cse21) (and .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse1 .cse8 (or .cse22 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse13 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse12) (and .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) (and .cse1 .cse2 .cse20 .cse3 .cse4) (and .cse16 .cse6 .cse1 .cse22 .cse8 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse17 .cse3 .cse18 .cse4 .cse19 .cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse12 .cse14))) [2021-10-13 06:44:43,851 INFO L853 garLoopResultBuilder]: At program point L531(lines 531 541) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,851 INFO L860 garLoopResultBuilder]: At program point L796(lines 780 835) the Hoare annotation is: true [2021-10-13 06:44:43,851 INFO L853 garLoopResultBuilder]: At program point L664(lines 724 726) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,852 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 832) no Hoare annotation was computed. [2021-10-13 06:44:43,852 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,852 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,852 INFO L857 garLoopResultBuilder]: For program point L798(lines 798 831) no Hoare annotation was computed. [2021-10-13 06:44:43,853 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,854 INFO L857 garLoopResultBuilder]: For program point L1591-2(lines 1589 1620) no Hoare annotation was computed. [2021-10-13 06:44:43,854 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,854 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 809) no Hoare annotation was computed. [2021-10-13 06:44:43,854 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 277) no Hoare annotation was computed. [2021-10-13 06:44:43,854 INFO L857 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-10-13 06:44:43,854 INFO L853 garLoopResultBuilder]: At program point L1594-1(lines 1594 1618) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (not (= ~IPC~0 2))) (.cse3 (= ~compRegistered~0 0))) (or (and .cse0 (<= (+ 5 ~NP~0) ~MPR3~0) (= ~s~0 ~DC~0) .cse1 (= 2 ~s~0) .cse2 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) (= ~pended~0 0) .cse3) (and .cse0 (= 2 ~DC~0) (= ~pended~0 1) .cse1 .cse2 (= ~s~0 ~NP~0) .cse3))) [2021-10-13 06:44:43,855 INFO L857 garLoopResultBuilder]: For program point L1462(lines 1462 1482) no Hoare annotation was computed. [2021-10-13 06:44:43,856 INFO L857 garLoopResultBuilder]: For program point L1330(lines 1330 1546) no Hoare annotation was computed. [2021-10-13 06:44:43,856 INFO L857 garLoopResultBuilder]: For program point L1066(lines 1066 1085) no Hoare annotation was computed. [2021-10-13 06:44:43,856 INFO L857 garLoopResultBuilder]: For program point L1066-1(lines 1066 1085) no Hoare annotation was computed. [2021-10-13 06:44:43,856 INFO L857 garLoopResultBuilder]: For program point L1066-2(lines 1066 1085) no Hoare annotation was computed. [2021-10-13 06:44:43,857 INFO L857 garLoopResultBuilder]: For program point L1066-3(lines 1066 1085) no Hoare annotation was computed. [2021-10-13 06:44:43,857 INFO L857 garLoopResultBuilder]: For program point L1463(lines 1463 1466) no Hoare annotation was computed. [2021-10-13 06:44:43,857 INFO L857 garLoopResultBuilder]: For program point L1067(lines 1067 1072) no Hoare annotation was computed. [2021-10-13 06:44:43,857 INFO L857 garLoopResultBuilder]: For program point L1067-2(lines 1067 1072) no Hoare annotation was computed. [2021-10-13 06:44:43,857 INFO L857 garLoopResultBuilder]: For program point L1067-4(lines 1067 1072) no Hoare annotation was computed. [2021-10-13 06:44:43,857 INFO L857 garLoopResultBuilder]: For program point L1067-6(lines 1067 1072) no Hoare annotation was computed. [2021-10-13 06:44:43,858 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,858 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 146) no Hoare annotation was computed. [2021-10-13 06:44:43,858 INFO L857 garLoopResultBuilder]: For program point L144-1(lines 144 146) no Hoare annotation was computed. [2021-10-13 06:44:43,858 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,858 INFO L853 garLoopResultBuilder]: At program point L543(lines 530 570) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,859 INFO L857 garLoopResultBuilder]: For program point L1468(lines 1468 1481) no Hoare annotation was computed. [2021-10-13 06:44:43,859 INFO L853 garLoopResultBuilder]: At program point L1074(lines 1066 1085) the Hoare annotation is: false [2021-10-13 06:44:43,859 INFO L853 garLoopResultBuilder]: At program point L1074-1(lines 1066 1085) the Hoare annotation is: false [2021-10-13 06:44:43,859 INFO L853 garLoopResultBuilder]: At program point L1074-2(lines 1066 1085) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,859 INFO L853 garLoopResultBuilder]: At program point L1074-3(lines 1066 1085) the Hoare annotation is: false [2021-10-13 06:44:43,859 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,860 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,860 INFO L857 garLoopResultBuilder]: For program point L1339(lines 1339 1544) no Hoare annotation was computed. [2021-10-13 06:44:43,860 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,860 INFO L853 garLoopResultBuilder]: At program point L811(lines 798 831) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0)) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse6 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse7 (<= 7 ~IPC~0)) (.cse8 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse1 (not (= ~SKIP2~0 2))) (.cse9 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse5 (= 2 ~DC~0)) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse14 (<= ULTIMATE.start_main_~status~1 258)) (.cse16 (or (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse12) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12))) (.cse13 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (not .cse3)) (.cse18 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse19 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse20 (<= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse1 .cse5 (= ~pended~0 1) .cse4) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4) (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse9 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse13 .cse14 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse15 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse20) (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) (or .cse14 (<= 260 ULTIMATE.start_main_~status~1)) (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse16 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse19 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258))) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse13 .cse9 .cse5 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse15 .cse17 .cse10 .cse18 .cse19 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse20 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse2 (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0))))) [2021-10-13 06:44:43,861 INFO L857 garLoopResultBuilder]: For program point L1472(lines 1472 1480) no Hoare annotation was computed. [2021-10-13 06:44:43,861 INFO L853 garLoopResultBuilder]: At program point L1340(lines 1330 1546) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,861 INFO L853 garLoopResultBuilder]: At program point L550-2(lines 550 566) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 .cse16 .cse17))))) [2021-10-13 06:44:43,862 INFO L853 garLoopResultBuilder]: At program point L418(lines 229 419) the Hoare annotation is: (let ((.cse2 (= 2 ~DC~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse13 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (= ~pended~0 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse16 (= ~s~0 ~DC~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse17 (= 2 ~s~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse6 .cse9) (and .cse10 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse1 .cse2 .cse4 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse12 .cse13 .cse7 .cse14 .cse15 .cse9) (and .cse1 .cse16 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse4 .cse17 .cse12 .cse7 .cse8 .cse14 .cse15) (and .cse10 .cse1 .cse16 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse4 .cse11 .cse17 .cse12 .cse13 .cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse8 .cse14 .cse15) (and (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse0 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6))) [2021-10-13 06:44:43,862 INFO L857 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2021-10-13 06:44:43,862 INFO L853 garLoopResultBuilder]: At program point L1079-1(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,862 INFO L857 garLoopResultBuilder]: For program point L1079-2(lines 1079 1083) no Hoare annotation was computed. [2021-10-13 06:44:43,862 INFO L853 garLoopResultBuilder]: At program point L1079-3(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,863 INFO L857 garLoopResultBuilder]: For program point L1079-4(lines 1079 1083) no Hoare annotation was computed. [2021-10-13 06:44:43,863 INFO L853 garLoopResultBuilder]: At program point L1079-5(lines 1079 1083) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,863 INFO L857 garLoopResultBuilder]: For program point L1079-6(lines 1079 1083) no Hoare annotation was computed. [2021-10-13 06:44:43,864 INFO L853 garLoopResultBuilder]: At program point L1079-7(lines 1079 1083) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ~pended~0 0)))) [2021-10-13 06:44:43,864 INFO L853 garLoopResultBuilder]: At program point L551(lines 550 566) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse19 (* 4294967296 .cse18))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse19 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse19 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse18 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse17 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 .cse16 .cse17))))) [2021-10-13 06:44:43,864 INFO L857 garLoopResultBuilder]: For program point L1476(lines 1476 1479) no Hoare annotation was computed. [2021-10-13 06:44:43,864 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,864 INFO L857 garLoopResultBuilder]: For program point L817(lines 817 829) no Hoare annotation was computed. [2021-10-13 06:44:43,865 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,865 INFO L857 garLoopResultBuilder]: For program point L1610(lines 1610 1616) no Hoare annotation was computed. [2021-10-13 06:44:43,865 INFO L853 garLoopResultBuilder]: At program point L157(lines 97 159) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= ~compRegistered~0 0))) (or (and .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse2 (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) .cse3) (and (not (= ~SKIP2~0 2)) .cse0 (= ~pended~0 1) .cse1 (not (= ~IPC~0 2)) .cse2 .cse3))) [2021-10-13 06:44:43,865 INFO L853 garLoopResultBuilder]: At program point L157-1(lines 97 159) the Hoare annotation is: (let ((.cse0 (= 2 ~DC~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse1 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse2 .cse3 .cse4 .cse5 (<= 4 ~SKIP2~0) (= ~pended~0 0) .cse6) (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-10-13 06:44:43,865 INFO L857 garLoopResultBuilder]: For program point L818(lines 818 822) no Hoare annotation was computed. [2021-10-13 06:44:43,866 INFO L857 garLoopResultBuilder]: For program point L1348(lines 1348 1542) no Hoare annotation was computed. [2021-10-13 06:44:43,866 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,866 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,866 INFO L853 garLoopResultBuilder]: At program point L1484(lines 1348 1542) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,866 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L295-1(lines 229 417) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,867 INFO L857 garLoopResultBuilder]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,868 INFO L857 garLoopResultBuilder]: For program point L956-10(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,868 INFO L857 garLoopResultBuilder]: For program point L956-12(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,868 INFO L857 garLoopResultBuilder]: For program point L956-14(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,868 INFO L857 garLoopResultBuilder]: For program point L956-16(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,868 INFO L857 garLoopResultBuilder]: For program point L956-18(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,868 INFO L857 garLoopResultBuilder]: For program point L956-20(lines 956 962) no Hoare annotation was computed. [2021-10-13 06:44:43,869 INFO L857 garLoopResultBuilder]: For program point L562(lines 562 564) no Hoare annotation was computed. [2021-10-13 06:44:43,869 INFO L853 garLoopResultBuilder]: At program point L431(lines 160 433) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (= ~pended~0 0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse11 (not (= ~SKIP2~0 2))) (.cse12 (= ~s~0 ~DC~0)) (.cse14 (= ~pended~0 1)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse13 (= 2 ~s~0)) (.cse15 (not (= ~IPC~0 2))) (.cse16 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse3 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse4 .cse13 .cse5 .cse6 .cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse8 .cse9) (and .cse11 .cse1 .cse2 .cse14 .cse3 .cse15 (= ~IPC~0 ~s~0) .cse16) (and .cse11 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse12 .cse3 .cse13 .cse15 .cse9) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse11 .cse1 .cse2 .cse14 .cse3 .cse7 (<= (+ ~NP~0 4) ~MPR1~0) .cse16 .cse10) (and (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse11 .cse12 .cse14 .cse3 .cse13 .cse15 .cse16))) [2021-10-13 06:44:43,870 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,870 INFO L857 garLoopResultBuilder]: For program point L1357(lines 1357 1540) no Hoare annotation was computed. [2021-10-13 06:44:43,870 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,871 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 307) no Hoare annotation was computed. [2021-10-13 06:44:43,871 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,871 INFO L853 garLoopResultBuilder]: At program point L567(lines 528 593) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse18 (* 4294967296 .cse17))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (< (+ .cse18 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse18 3221225494))) (.cse11 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (< 0 (+ .cse17 2))) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (= ~pended~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse14 .cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse16))))) [2021-10-13 06:44:43,871 INFO L857 garLoopResultBuilder]: For program point L1362(lines 1362 1538) no Hoare annotation was computed. [2021-10-13 06:44:43,871 INFO L857 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,872 INFO L857 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,872 INFO L857 garLoopResultBuilder]: For program point L1627-2(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,872 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,872 INFO L857 garLoopResultBuilder]: For program point L1627-3(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,872 INFO L857 garLoopResultBuilder]: For program point L1627-4(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,872 INFO L857 garLoopResultBuilder]: For program point L1627-5(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-6(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-7(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-8(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-9(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-10(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-11(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,873 INFO L857 garLoopResultBuilder]: For program point L1627-12(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,874 INFO L857 garLoopResultBuilder]: For program point L1627-13(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,874 INFO L857 garLoopResultBuilder]: For program point L1627-14(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,874 INFO L857 garLoopResultBuilder]: For program point L1627-15(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,874 INFO L857 garLoopResultBuilder]: For program point L1627-16(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,874 INFO L857 garLoopResultBuilder]: For program point L1627-17(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,874 INFO L857 garLoopResultBuilder]: For program point L1627-18(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point L1627-19(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point L1627-20(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point L1627-21(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point L1627-22(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point L1627-23(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,875 INFO L857 garLoopResultBuilder]: For program point L1627-24(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,876 INFO L857 garLoopResultBuilder]: For program point L1627-25(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,876 INFO L857 garLoopResultBuilder]: For program point L1627-26(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,876 INFO L857 garLoopResultBuilder]: For program point L1627-27(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,877 INFO L857 garLoopResultBuilder]: For program point L1627-28(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,877 INFO L857 garLoopResultBuilder]: For program point L1627-29(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,877 INFO L857 garLoopResultBuilder]: For program point L1627-30(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,877 INFO L853 garLoopResultBuilder]: At program point L1628(lines 1039 1052) the Hoare annotation is: (and (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,877 INFO L857 garLoopResultBuilder]: For program point L1627-31(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,878 INFO L853 garLoopResultBuilder]: At program point L1628-1(lines 1039 1052) the Hoare annotation is: (and (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,878 INFO L857 garLoopResultBuilder]: For program point L1627-32(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,878 INFO L853 garLoopResultBuilder]: At program point L1628-2(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,878 INFO L857 garLoopResultBuilder]: For program point L1627-33(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,878 INFO L853 garLoopResultBuilder]: At program point L1628-3(lines 1 1630) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,878 INFO L857 garLoopResultBuilder]: For program point L1627-34(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,879 INFO L853 garLoopResultBuilder]: At program point L1628-4(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,879 INFO L857 garLoopResultBuilder]: For program point L1627-35(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,879 INFO L853 garLoopResultBuilder]: At program point L1628-5(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,879 INFO L857 garLoopResultBuilder]: For program point L1627-36(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,879 INFO L857 garLoopResultBuilder]: For program point L1627-37(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,879 INFO L853 garLoopResultBuilder]: At program point L1628-7(lines 1 1630) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~pended~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse5 (<= 4 ~SKIP2~0) .cse6 .cse7 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 (not (= ~SKIP2~0 2)) .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-13 06:44:43,880 INFO L857 garLoopResultBuilder]: For program point L1627-38(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,880 INFO L853 garLoopResultBuilder]: At program point L1628-8(lines 1 1630) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,880 INFO L857 garLoopResultBuilder]: For program point L1627-39(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,880 INFO L853 garLoopResultBuilder]: At program point L1628-9(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,880 INFO L857 garLoopResultBuilder]: For program point L1627-40(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,881 INFO L857 garLoopResultBuilder]: For program point L1627-41(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,881 INFO L853 garLoopResultBuilder]: At program point L1628-11(lines 1 1630) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (<= 7 ~IPC~0)) (.cse2 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (= ~pended~0 0)) (.cse7 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse5 (<= 4 ~SKIP2~0) .cse6 .cse7 (= ~SKIP2~0 ~s~0)) (and .cse0 .cse1 (not (= ~SKIP2~0 2)) .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-13 06:44:43,881 INFO L857 garLoopResultBuilder]: For program point L1627-42(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,881 INFO L857 garLoopResultBuilder]: For program point L1627-43(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,881 INFO L853 garLoopResultBuilder]: At program point L1628-13(lines 1039 1052) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,881 INFO L857 garLoopResultBuilder]: For program point L1627-44(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,882 INFO L857 garLoopResultBuilder]: For program point L1627-45(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,882 INFO L857 garLoopResultBuilder]: For program point L1627-46(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,882 INFO L857 garLoopResultBuilder]: For program point L1627-47(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,882 INFO L853 garLoopResultBuilder]: At program point L1628-17(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,882 INFO L857 garLoopResultBuilder]: For program point L1627-48(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,882 INFO L857 garLoopResultBuilder]: For program point L1627-49(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,883 INFO L857 garLoopResultBuilder]: For program point L1627-50(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,883 INFO L853 garLoopResultBuilder]: At program point L1628-20(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,884 INFO L857 garLoopResultBuilder]: For program point L1627-51(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,884 INFO L857 garLoopResultBuilder]: For program point L1627-52(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,884 INFO L853 garLoopResultBuilder]: At program point L1628-22(lines 1039 1052) the Hoare annotation is: (let ((.cse19 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse20 (* 4294967296 .cse19))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse2 (not (= ~SKIP2~0 2))) (.cse3 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse4 (= ~s~0 ~DC~0)) (.cse5 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse8 (= 2 ~s~0)) (.cse9 (< (+ .cse20 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (.cse10 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= (+ .cse19 1) 0)) (.cse12 (not (= ~IPC~0 2))) (.cse13 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse20 3221225494))) (.cse14 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (< 0 (+ .cse19 2))) (.cse17 (<= 4 ~SKIP2~0)) (.cse18 (= ~pended~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse16 .cse17 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse18) (and .cse0 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse16 .cse17 .cse18))))) [2021-10-13 06:44:43,884 INFO L853 garLoopResultBuilder]: At program point L1628-23(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,885 INFO L853 garLoopResultBuilder]: At program point L1628-25(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 06:44:43,885 INFO L853 garLoopResultBuilder]: At program point L1628-26(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,885 INFO L853 garLoopResultBuilder]: At program point L1628-28(lines 1 1630) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,885 INFO L853 garLoopResultBuilder]: At program point L1628-30(lines 1 1630) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse2 (= 2 ~DC~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~IPC~0 2)) (= ~IPC~0 ~s~0) .cse5) (and (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) .cse5 (= ~SKIP2~0 ~s~0)))) [2021-10-13 06:44:43,885 INFO L853 garLoopResultBuilder]: At program point L1628-32(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,886 INFO L853 garLoopResultBuilder]: At program point L1628-34(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 06:44:43,886 INFO L853 garLoopResultBuilder]: At program point L1628-38(lines 1 1630) the Hoare annotation is: (let ((.cse2 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (* 4294967296 .cse2))) (and (= ~compRegistered~0 1) (or (not .cse0) (= ~MPR3~0 ~s~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (= ~s~0 ~NP~0) .cse0) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (< (+ .cse1 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse2 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse1 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse2 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)))) [2021-10-13 06:44:43,886 INFO L853 garLoopResultBuilder]: At program point L1628-41(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,886 INFO L853 garLoopResultBuilder]: At program point L1628-43(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 06:44:43,887 INFO L853 garLoopResultBuilder]: At program point L1628-44(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,887 INFO L853 garLoopResultBuilder]: At program point L1628-46(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 06:44:43,887 INFO L853 garLoopResultBuilder]: At program point L1628-47(lines 1 1630) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,887 INFO L853 garLoopResultBuilder]: At program point L1628-49(lines 1 1630) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0)) [2021-10-13 06:44:43,887 INFO L860 garLoopResultBuilder]: At program point L837(lines 667 839) the Hoare annotation is: true [2021-10-13 06:44:43,888 INFO L853 garLoopResultBuilder]: At program point L707(lines 701 838) the Hoare annotation is: (let ((.cse18 (= ~IPC~0 ~s~0)) (.cse16 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0)) (.cse17 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse20 (<= ULTIMATE.start_main_~status~1 258)) (.cse8 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse10 (<= (+ 2 ~NP~0) ~SKIP1~0)) (.cse12 (<= 4 ~SKIP2~0)) (.cse14 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (<= 7 ~IPC~0)) (.cse1 (<= (+ 5 ~NP~0) ~MPR3~0)) (.cse7 (= 2 ~DC~0)) (.cse21 (= ~pended~0 1)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse23 (<= (+ 1073741738 ULTIMATE.start_main_~status~1) 0)) (.cse0 (not (= ~SKIP2~0 2))) (.cse3 (= 2 ~s~0)) (.cse4 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (= ~pended~0 0)) (.cse22 (= ~compRegistered~0 0))) (or (and (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5) (and (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) .cse6 .cse1 .cse7 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse12 .cse5 .cse13 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse14 .cse15 .cse16 .cse0 .cse1 .cse7 .cse17 .cse18 .cse19 .cse5) (and .cse15 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 (or .cse20 (<= 260 ULTIMATE.start_main_~status~1)) .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) .cse11 (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse19 .cse5) (and .cse0 .cse1 .cse7 .cse21 .cse4 .cse18 .cse22) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse22) (and .cse14 .cse15 .cse16 .cse1 .cse7 .cse17 .cse11 .cse19 .cse12 .cse5 .cse13) (and .cse23 .cse0 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse5) (and .cse6 .cse15 .cse0 .cse20 .cse1 .cse2 (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8 .cse3 .cse9 .cse4 .cse10 .cse11 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse19 .cse12 .cse5) (and .cse0 .cse7 .cse21 .cse4 (= ~s~0 ~NP~0) .cse22) (and .cse14 .cse15 .cse0 .cse1 .cse7 .cse21 .cse11 .cse19 .cse22 .cse13) (and .cse23 .cse0 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res|) 0) .cse2 .cse3 .cse4 .cse5) (and .cse2 (= ULTIMATE.start_main_~status~1 0) .cse5 .cse22))) [2021-10-13 06:44:43,888 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,888 INFO L857 garLoopResultBuilder]: For program point L1369(lines 1369 1536) no Hoare annotation was computed. [2021-10-13 06:44:43,888 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,889 INFO L853 garLoopResultBuilder]: At program point L974(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,889 INFO L853 garLoopResultBuilder]: At program point L974-1(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,889 INFO L853 garLoopResultBuilder]: At program point L974-2(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,889 INFO L853 garLoopResultBuilder]: At program point L974-3(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,889 INFO L853 garLoopResultBuilder]: At program point L974-4(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 06:44:43,890 INFO L853 garLoopResultBuilder]: At program point L974-5(lines 974 986) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 06:44:43,890 INFO L853 garLoopResultBuilder]: At program point L974-6(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 06:44:43,890 INFO L853 garLoopResultBuilder]: At program point L974-7(lines 974 986) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 06:44:43,891 INFO L853 garLoopResultBuilder]: At program point L974-8(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,891 INFO L853 garLoopResultBuilder]: At program point L974-9(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,892 INFO L853 garLoopResultBuilder]: At program point L974-10(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,892 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,892 INFO L853 garLoopResultBuilder]: At program point L974-11(lines 974 986) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,892 INFO L853 garLoopResultBuilder]: At program point L974-12(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,893 INFO L853 garLoopResultBuilder]: At program point L974-13(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,893 INFO L853 garLoopResultBuilder]: At program point L974-14(lines 974 986) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 06:44:43,893 INFO L853 garLoopResultBuilder]: At program point L974-15(lines 974 986) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 06:44:43,893 INFO L853 garLoopResultBuilder]: At program point L974-16(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,894 INFO L853 garLoopResultBuilder]: At program point L974-17(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,895 INFO L853 garLoopResultBuilder]: At program point L974-18(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,896 INFO L853 garLoopResultBuilder]: At program point L974-19(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,896 INFO L853 garLoopResultBuilder]: At program point L974-20(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,896 INFO L853 garLoopResultBuilder]: At program point L974-21(lines 974 986) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,896 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,896 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,897 INFO L857 garLoopResultBuilder]: For program point L1376(lines 1376 1534) no Hoare annotation was computed. [2021-10-13 06:44:43,897 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 331) no Hoare annotation was computed. [2021-10-13 06:44:43,897 INFO L857 garLoopResultBuilder]: For program point L980(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,897 INFO L857 garLoopResultBuilder]: For program point L980-2(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,897 INFO L857 garLoopResultBuilder]: For program point L980-4(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,897 INFO L857 garLoopResultBuilder]: For program point L980-6(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-8(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-10(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-12(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-14(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-16(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-18(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,898 INFO L857 garLoopResultBuilder]: For program point L980-20(lines 980 984) no Hoare annotation was computed. [2021-10-13 06:44:43,899 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 06:44:43,899 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 330) no Hoare annotation was computed. [2021-10-13 06:44:43,899 INFO L853 garLoopResultBuilder]: At program point L324-1(lines 1 1630) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 06:44:43,899 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,899 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,899 INFO L857 garLoopResultBuilder]: For program point L1383(lines 1383 1532) no Hoare annotation was computed. [2021-10-13 06:44:43,900 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,900 INFO L853 garLoopResultBuilder]: At program point L1384(lines 1376 1534) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,900 INFO L857 garLoopResultBuilder]: For program point L198(lines 198 206) no Hoare annotation was computed. [2021-10-13 06:44:43,900 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,900 INFO L853 garLoopResultBuilder]: At program point L730(lines 730 778) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,901 INFO L853 garLoopResultBuilder]: At program point L1526(lines 1401 1527) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= 2 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~s~0 ~NP~0)) (.cse5 (<= (+ 5 ~s~0) ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ~pended~0 0)) (.cse4 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 (= ~pended~0 1) .cse2 (not (= ~IPC~0 2)) .cse3 .cse4) (and .cse1 (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse2 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse3 (<= (+ 2 ~NP~0) ~SKIP1~0) .cse5 (not (= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 259)) .cse6 (<= 4 ~SKIP2~0) .cse7 .cse4) (and (<= 7 ~IPC~0) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= (+ ~NP~0 4) ~MPR1~0) .cse7 .cse4 (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 0)))) [2021-10-13 06:44:43,901 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,901 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,901 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,901 INFO L853 garLoopResultBuilder]: At program point L735(lines 735 777) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,902 INFO L853 garLoopResultBuilder]: At program point L207(lines 207 426) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,902 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,902 INFO L857 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2021-10-13 06:44:43,902 INFO L857 garLoopResultBuilder]: For program point L340-2(lines 340 345) no Hoare annotation was computed. [2021-10-13 06:44:43,902 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,902 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 425) no Hoare annotation was computed. [2021-10-13 06:44:43,903 INFO L853 garLoopResultBuilder]: At program point L1400(lines 1390 1530) the Hoare annotation is: (and (<= 7 ~IPC~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~NP~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,903 INFO L853 garLoopResultBuilder]: At program point L740(lines 740 776) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,903 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 424) no Hoare annotation was computed. [2021-10-13 06:44:43,903 INFO L853 garLoopResultBuilder]: At program point L214(lines 210 425) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,903 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 423) no Hoare annotation was computed. [2021-10-13 06:44:43,904 INFO L853 garLoopResultBuilder]: At program point L1009(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,904 INFO L853 garLoopResultBuilder]: At program point L1009-1(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,904 INFO L853 garLoopResultBuilder]: At program point L1009-2(lines 973 1037) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 06:44:43,904 INFO L853 garLoopResultBuilder]: At program point L1009-3(lines 973 1037) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 06:44:43,905 INFO L853 garLoopResultBuilder]: At program point L1009-4(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,912 INFO L853 garLoopResultBuilder]: At program point L1009-5(lines 973 1037) the Hoare annotation is: (and (<= 7 ~IPC~0) (not (= ~SKIP2~0 2)) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ~pended~0 1) (= ULTIMATE.start_main_~status~1 0) (<= (+ 2 ~s~0) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,912 INFO L853 garLoopResultBuilder]: At program point L1009-6(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,912 INFO L853 garLoopResultBuilder]: At program point L1009-7(lines 973 1037) the Hoare annotation is: (let ((.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (* 4294967296 .cse1))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (= ULTIMATE.start_main_~status~1 0) (< (+ .cse0 3221225493) ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ .cse1 1) 0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ .cse0 3221225494)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (< 0 (+ .cse1 2)) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~MPR1~0 ~s~0)))) [2021-10-13 06:44:43,913 INFO L853 garLoopResultBuilder]: At program point L745(lines 745 775) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,913 INFO L853 garLoopResultBuilder]: At program point L1009-8(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,913 INFO L853 garLoopResultBuilder]: At program point L1009-9(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,913 INFO L853 garLoopResultBuilder]: At program point L1009-10(lines 973 1037) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,913 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,914 INFO L853 garLoopResultBuilder]: At program point L85(lines 707 779) the Hoare annotation is: (and (<= (+ 5 ~NP~0) ~MPR3~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (not (= 2 ~s~0)) (= ~myStatus~0 0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ 2 ~s~0) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,914 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,914 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 06:44:43,914 INFO L857 garLoopResultBuilder]: For program point L1275(lines 1275 1287) no Hoare annotation was computed. [2021-10-13 06:44:43,914 INFO L857 garLoopResultBuilder]: For program point L1275-2(lines 1274 1563) no Hoare annotation was computed. [2021-10-13 06:44:43,915 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,915 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 422) no Hoare annotation was computed. [2021-10-13 06:44:43,916 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,916 INFO L853 garLoopResultBuilder]: At program point L220(lines 216 423) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,916 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,916 INFO L853 garLoopResultBuilder]: At program point L222(lines 222 421) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,916 INFO L857 garLoopResultBuilder]: For program point L1280(lines 1280 1285) no Hoare annotation was computed. [2021-10-13 06:44:43,916 INFO L857 garLoopResultBuilder]: For program point L1017(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,917 INFO L857 garLoopResultBuilder]: For program point L1017-1(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,917 INFO L857 garLoopResultBuilder]: For program point L1017-2(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,917 INFO L857 garLoopResultBuilder]: For program point L1017-3(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,917 INFO L857 garLoopResultBuilder]: For program point L1017-4(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,917 INFO L857 garLoopResultBuilder]: For program point L1017-5(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,917 INFO L857 garLoopResultBuilder]: For program point L1017-6(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,918 INFO L857 garLoopResultBuilder]: For program point L1017-7(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,918 INFO L857 garLoopResultBuilder]: For program point L1017-8(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,918 INFO L857 garLoopResultBuilder]: For program point L1017-9(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,918 INFO L857 garLoopResultBuilder]: For program point L1017-10(lines 1017 1034) no Hoare annotation was computed. [2021-10-13 06:44:43,918 INFO L853 garLoopResultBuilder]: At program point L225(lines 225 420) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,918 INFO L857 garLoopResultBuilder]: For program point L491(lines 491 503) no Hoare annotation was computed. [2021-10-13 06:44:43,919 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 366) no Hoare annotation was computed. [2021-10-13 06:44:43,919 INFO L853 garLoopResultBuilder]: At program point L228(lines 227 420) the Hoare annotation is: (and (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2021-10-13 06:44:43,919 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,919 INFO L857 garLoopResultBuilder]: For program point L627(lines 627 629) no Hoare annotation was computed. [2021-10-13 06:44:43,919 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,919 INFO L857 garLoopResultBuilder]: For program point L496(lines 496 502) no Hoare annotation was computed. [2021-10-13 06:44:43,920 INFO L853 garLoopResultBuilder]: At program point L496-1(lines 1 1630) the Hoare annotation is: (and (= ~compRegistered~0 1) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ 2 ~NP~0) ~SKIP1~0) (<= (+ 5 ~s~0) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~pended~0 0)) [2021-10-13 06:44:43,920 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,920 INFO L857 garLoopResultBuilder]: For program point L1554(lines 1554 1560) no Hoare annotation was computed. [2021-10-13 06:44:43,920 INFO L853 garLoopResultBuilder]: At program point L1554-1(lines 1554 1560) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse5 (not (= ~IPC~0 2))) (.cse0 (not (= ~SKIP2~0 2))) (.cse1 (= ~s~0 ~DC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= 2 ~s~0)) (.cse6 (= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 2 ~DC~0) .cse2 .cse3 .cse5 (= ~s~0 ~NP~0) .cse6) (and (<= 7 ~IPC~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 (<= (+ 5 ~NP~0) ~MPR3~0) .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 (or (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~pended~0 0) .cse6))) [2021-10-13 06:44:43,920 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-13 06:44:43,921 INFO L857 garLoopResultBuilder]: For program point L1026(lines 1026 1033) no Hoare annotation was computed. [2021-10-13 06:44:43,926 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 06:44:44,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:44:44 BoogieIcfgContainer [2021-10-13 06:44:44,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 06:44:44,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 06:44:44,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 06:44:44,049 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 06:44:44,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:20" (3/4) ... [2021-10-13 06:44:44,054 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 06:44:44,107 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 278 nodes and edges [2021-10-13 06:44:44,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 89 nodes and edges [2021-10-13 06:44:44,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-13 06:44:44,123 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-13 06:44:44,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-13 06:44:44,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-13 06:44:44,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 == s) && !(MPR3 == s))) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && !(MPR3 == s))) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0)) || ((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2))) || ((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) [2021-10-13 06:44:44,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || (((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2))) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && !(2 == s)) && lowerDriverReturn == status) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || ((((((((((returnVal2 <= lowerDriverReturn && status <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2)) || (((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258))) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && lowerDriverReturn <= status)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) [2021-10-13 06:44:44,170 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || ((((((((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2) && pended == 0)) || (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) [2021-10-13 06:44:44,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) [2021-10-13 06:44:44,177 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) || (((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && !(ntStatus == 259)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) && ntStatus <= 0) [2021-10-13 06:44:44,177 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || (((((((((\result + 1073741536 <= 0 && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) [2021-10-13 06:44:44,180 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) [2021-10-13 06:44:44,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && status <= 258) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && status <= 258) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-13 06:44:44,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 [2021-10-13 06:44:44,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 [2021-10-13 06:44:44,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-13 06:44:44,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) [2021-10-13 06:44:44,392 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 06:44:44,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 06:44:44,394 INFO L168 Benchmark]: Toolchain (without parser) took 27528.67 ms. Allocated memory was 115.3 MB in the beginning and 427.8 MB in the end (delta: 312.5 MB). Free memory was 85.1 MB in the beginning and 324.1 MB in the end (delta: -239.1 MB). Peak memory consumption was 72.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,394 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 115.3 MB. Free memory was 67.8 MB in the beginning and 67.8 MB in the end (delta: 53.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:44:44,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.86 ms. Allocated memory is still 115.3 MB. Free memory was 84.8 MB in the beginning and 74.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.61 ms. Allocated memory is still 115.3 MB. Free memory was 74.7 MB in the beginning and 64.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,397 INFO L168 Benchmark]: Boogie Preprocessor took 191.75 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 64.1 MB in the beginning and 108.2 MB in the end (delta: -44.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,397 INFO L168 Benchmark]: RCFGBuilder took 2946.00 ms. Allocated memory was 138.4 MB in the beginning and 178.3 MB in the end (delta: 39.8 MB). Free memory was 108.1 MB in the beginning and 134.7 MB in the end (delta: -26.6 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,398 INFO L168 Benchmark]: TraceAbstraction took 23222.05 ms. Allocated memory was 178.3 MB in the beginning and 427.8 MB in the end (delta: 249.6 MB). Free memory was 134.7 MB in the beginning and 373.4 MB in the end (delta: -238.7 MB). Peak memory consumption was 258.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,398 INFO L168 Benchmark]: Witness Printer took 343.32 ms. Allocated memory is still 427.8 MB. Free memory was 373.4 MB in the beginning and 324.1 MB in the end (delta: 49.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:44,401 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.28 ms. Allocated memory is still 115.3 MB. Free memory was 67.8 MB in the beginning and 67.8 MB in the end (delta: 53.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 666.86 ms. Allocated memory is still 115.3 MB. Free memory was 84.8 MB in the beginning and 74.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 143.61 ms. Allocated memory is still 115.3 MB. Free memory was 74.7 MB in the beginning and 64.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 191.75 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 64.1 MB in the beginning and 108.2 MB in the end (delta: -44.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2946.00 ms. Allocated memory was 138.4 MB in the beginning and 178.3 MB in the end (delta: 39.8 MB). Free memory was 108.1 MB in the beginning and 134.7 MB in the end (delta: -26.6 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23222.05 ms. Allocated memory was 178.3 MB in the beginning and 427.8 MB in the end (delta: 249.6 MB). Free memory was 134.7 MB in the beginning and 373.4 MB in the end (delta: -238.7 MB). Peak memory consumption was 258.3 MB. Max. memory is 16.1 GB. * Witness Printer took 343.32 ms. Allocated memory is still 427.8 MB. Free memory was 373.4 MB in the beginning and 324.1 MB in the end (delta: 49.3 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 351 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 23036.6ms, OverallIterations: 48, TraceHistogramMax: 1, EmptinessCheckTime: 66.5ms, AutomataDifference: 6355.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 12130.2ms, InitialAbstractionConstructionTime: 17.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11730 SDtfs, 7663 SDslu, 14234 SDs, 0 SdLazy, 3717 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2868.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1109.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=3, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1225.2ms AutomataMinimizationTime, 48 MinimizatonAttempts, 658 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 348 NumberOfFragments, 8598 HoareAnnotationTreeSize, 114 FomulaSimplifications, 2854397 FormulaSimplificationTreeSizeReduction, 1835.5ms HoareSimplificationTime, 114 FomulaSimplificationsInter, 515337 FormulaSimplificationTreeSizeReductionInter, 10259.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 163.0ms SsaConstructionTime, 606.1ms SatisfiabilityAnalysisTime, 1773.0ms InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1259 ConstructedInterpolants, 0 QuantifiedInterpolants, 3493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP2 == s)) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 == s) && !(MPR3 == s))) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && !(MPR3 == s))) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0)) || ((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2))) || ((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1321]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((((((((returnVal2 <= lowerDriverReturn && lowerDriverReturn <= ntStatus) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && ntStatus <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || (((((((((5 + NP <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && status == 0) && 2 == s) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) || (((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && pended == 1) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= ntStatus) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && ntStatus <= lowerDriverReturn) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && (259 == __cil_tmp30 || ntStatus <= 258)) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1401]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) || (((((((((((2 == DC && !(259 == \result)) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && !(ntStatus == 259)) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0)) || ((((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) && ntStatus <= 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: ((((((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && !(2 == s)) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && 2 + s <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 724]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || ((((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 2 == s) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(IPC == 2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && ntStatus + 1 <= 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && pended == 0) || ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 740]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((s == DC && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1390]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) || (((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2))) || ((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && !(2 == s)) && lowerDriverReturn == status) && NP + 4 <= MPR1)) || (((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2))) || (((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0)) || ((((((((((returnVal2 <= lowerDriverReturn && status <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2)) || (((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && NP + 4 <= MPR1) || (((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && NP + 4 <= MPR1))) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258))) || ((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && !(2 == s)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && lowerDriverReturn <= status)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && myStatus == 0) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((compRegistered == 1 && (!(259 == returnVal2) || MPR3 == s)) && returnVal2 <= lowerDriverReturn) && (s == NP || 259 == returnVal2)) && setEventCalled == 1) && 5 + NP <= MPR3) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((s == DC && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: ((((((((((((!(SKIP2 == 2) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || (((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s)) || (((((((((\result + 1073741536 <= 0 && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && \result + 1073741670 <= 0) && status <= 258) && 2 == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) || (((((((((((((((((((lowerDriverReturn == returnVal2 && compRegistered == 1) && status <= 258) && 2 == DC) && ntStatus <= 258) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && \result <= 258) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && ntStatus == 0) && pended == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && myStatus == 0) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1554]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0)) || ((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == s) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((5 + NP <= MPR3 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && 2 + s <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((status + 1073741536 <= 0 && \result + 1073741536 <= 0) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) || (((((((((((((status < lowerDriverReturn + 1 && returnVal2 <= lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) && lowerDriverReturn <= status)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && IPC == s) && NP + 4 <= MPR1) && pended == 0)) || (((((((((((((7 <= IPC && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && (status <= 258 || 260 <= status)) && s == DC) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && 2 == s) && !(IPC == 2)) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && (260 <= \result || \result <= 258)) && NP + 4 <= MPR1) && pended == 0)) || ((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || (((((!(SKIP2 == 2) && s == DC) && pended == 1) && 2 == s) && !(IPC == 2)) && compRegistered == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && \result == lowerDriverReturn) && 5 + NP <= MPR3) && 2 == DC) && lowerDriverReturn == status) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && s == DC) && 2 == s) && !(IPC == 2)) && \result + 1073741738 <= 0) && pended == 0)) || (((((((((((((((((returnVal2 <= lowerDriverReturn && 7 <= IPC) && !(SKIP2 == 2)) && status <= 258) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && !(IPC == 2)) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0)) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || ((((((1073741738 + status <= 0 && !(SKIP2 == 2)) && 1073741738 + \result <= 0) && s == DC) && 2 == s) && !(IPC == 2)) && pended == 0)) || (((s == DC && status == 0) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1376]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && !(SKIP2 == 2)) && 2 == DC) && status == 0) && s == NP) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0) && SKIP2 == s) || (((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && status == 0) && IPC == s) && NP + 4 <= MPR1) && pended == 0) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && 2 == DC) && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 735]: Loop Invariant Derived loop invariant: (((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((((returnVal2 <= lowerDriverReturn && 5 + NP <= MPR3) && 2 == DC) && \result <= lowerDriverReturn) && status == 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && lowerDriverReturn <= \result) && 4 <= SKIP2) && pended == 0) && SKIP2 == s) || ((((((((((((((returnVal2 <= lowerDriverReturn && !(SKIP2 == 2)) && 5 + NP <= MPR3) && s == DC) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && \result <= 258) && lowerDriverReturn <= returnVal2) && 2 == s) && SKIP2 + 3 <= IPC) && 2 + NP <= SKIP1) && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && 4 <= SKIP2) && pended == 0)) || (((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && IPC == s) && compRegistered == 0)) || ((((((!(SKIP2 == 2) && 1073741738 + \result <= 0) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && pended == 0)) || ((((((((((lowerDriverReturn == returnVal2 && 7 <= IPC) && !(SKIP2 == 2)) && 5 + NP <= MPR3) && 2 == DC) && pended == 1) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered == 0) && SKIP2 == s)) || (((((((!(259 == __cil_tmp29) && !(SKIP2 == 2)) && s == DC) && pended == 1) && status == 0) && 2 == s) && !(IPC == 2)) && compRegistered == 0) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((((((((((((compRegistered == 1 && returnVal2 <= lowerDriverReturn) && 2 == DC) && (ntStatus <= 258 || 259 == __cil_tmp11)) && ((returnVal2 == 0 || 1073741823 + returnVal2 == 0) || 259 == returnVal2)) && status == 0) && lowerDriverReturn <= returnVal2) && 4294967296 * (__cil_tmp7 / 4294967296) + 3221225493 < __cil_tmp7) && SKIP2 + 3 <= IPC) && __cil_tmp7 / 4294967296 + 1 <= 0) && s == NP) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 0 < __cil_tmp7 / 4294967296 + 2) && 4 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && ntStatus == 0) && pended == 0 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: ((((((((2 == DC && status == 0) && SKIP2 + 3 <= IPC) && s == NP) && 2 + NP <= SKIP1) && 5 + s <= MPR3) && SKIP1 + 2 <= MPR1) && 4 <= SKIP2) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: ((((((((!(SKIP2 == 2) && 5 + NP <= MPR3) && s == DC) && status == 0) && 2 == s) && !(IPC == 2)) && ntStatus + 1073741536 <= 0) && pended == 0) && compRegistered == 0) || ((((((!(SKIP2 == 2) && 2 == DC) && pended == 1) && status == 0) && !(IPC == 2)) && s == NP) && compRegistered == 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((7 <= IPC && 5 + NP <= MPR3) && 2 == DC) && status == 0) && 2 + s <= MPR1) && NP + 4 <= MPR1) && 4 <= SKIP2) && SKIP1 == s) && pended == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-10-13 06:44:44,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e6295e8-d9d7-4ca6-a9c7-d23ddb58a03c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...