./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/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_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:08:39,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:08:39,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:08:39,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:08:39,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:08:39,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:08:39,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:08:39,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:08:39,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:08:39,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:08:39,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:08:39,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:08:39,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:08:39,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:08:39,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:08:39,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:08:39,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:08:39,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:08:39,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:08:39,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:08:39,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:08:39,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:08:39,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:08:39,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:08:39,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:08:39,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:08:39,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:08:39,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:08:39,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:08:39,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:08:39,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:08:39,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:08:39,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:08:39,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:08:39,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:08:39,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:08:39,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:08:39,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:08:39,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:08:39,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:08:39,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:08:39,680 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:08:39,719 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:08:39,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:08:39,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:08:39,722 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:08:39,722 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:08:39,722 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:08:39,722 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:08:39,723 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:08:39,723 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:08:39,723 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:08:39,724 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:08:39,725 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:08:39,725 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:08:39,725 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:08:39,726 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:08:39,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:08:39,727 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:08:39,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:08:39,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:08:39,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:08:39,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:08:39,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:08:39,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:08:39,728 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:08:39,729 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:08:39,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:08:39,729 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:08:39,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:08:39,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:08:39,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:08:39,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:08:39,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:08:39,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:08:39,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:08:39,734 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:08:39,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:08:39,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:08:39,735 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:08:39,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:08:39,735 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_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-11-07 01:08:40,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:08:40,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:08:40,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:08:40,062 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:08:40,063 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:08:40,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-11-07 01:08:40,155 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/data/77402c57a/60910d0f0ac44c16baaf1f824d82442f/FLAG9713c33d8 [2021-11-07 01:08:40,801 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:08:40,801 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-11-07 01:08:40,819 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/data/77402c57a/60910d0f0ac44c16baaf1f824d82442f/FLAG9713c33d8 [2021-11-07 01:08:41,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/data/77402c57a/60910d0f0ac44c16baaf1f824d82442f [2021-11-07 01:08:41,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:08:41,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:08:41,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:08:41,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:08:41,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:08:41,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f8cbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41, skipping insertion in model container [2021-11-07 01:08:41,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:08:41,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:08:41,523 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_e5a89c0f-53bb-4987-bf39-0d15adbb198b/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-11-07 01:08:41,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:08:41,539 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:08:41,716 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_e5a89c0f-53bb-4987-bf39-0d15adbb198b/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-11-07 01:08:41,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:08:41,734 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:08:41,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41 WrapperNode [2021-11-07 01:08:41,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:08:41,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:08:41,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:08:41,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:08:41,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:08:41,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:08:41,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:08:41,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:08:41,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:41,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:42,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:42,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:42,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:08:42,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:08:42,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:08:42,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:08:42,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (1/1) ... [2021-11-07 01:08:42,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:08:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:08:42,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:08:42,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:08:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:08:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:08:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:08:42,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:08:42,551 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,576 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,578 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,583 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,584 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,585 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,589 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,594 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,601 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,603 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,608 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,609 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,612 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,618 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,622 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,622 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,626 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,629 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,630 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,631 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,632 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,636 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,639 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,642 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,644 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,646 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,648 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,649 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,650 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:42,652 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 01:08:43,814 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-11-07 01:08:43,814 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-11-07 01:08:43,815 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-11-07 01:08:43,815 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-11-07 01:08:43,816 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-11-07 01:08:43,816 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-11-07 01:08:43,816 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-11-07 01:08:43,816 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-11-07 01:08:43,816 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-11-07 01:08:43,817 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-11-07 01:08:43,817 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-11-07 01:08:43,817 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-11-07 01:08:43,817 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-11-07 01:08:43,818 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-11-07 01:08:43,818 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-11-07 01:08:43,818 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-11-07 01:08:43,819 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-11-07 01:08:43,819 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-11-07 01:08:43,819 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-11-07 01:08:43,820 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-11-07 01:08:43,821 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-11-07 01:08:43,821 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-11-07 01:08:43,821 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-11-07 01:08:43,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-11-07 01:08:43,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-11-07 01:08:43,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-11-07 01:08:43,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-11-07 01:08:43,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-11-07 01:08:43,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-11-07 01:08:43,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-11-07 01:08:43,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-11-07 01:08:43,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-11-07 01:08:43,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-11-07 01:08:43,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-11-07 01:08:43,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-11-07 01:08:43,824 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-11-07 01:08:43,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-11-07 01:08:43,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-11-07 01:08:43,825 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-11-07 01:08:43,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-11-07 01:08:43,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-11-07 01:08:43,826 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-11-07 01:08:43,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-11-07 01:08:43,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-11-07 01:08:43,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-11-07 01:08:43,827 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-11-07 01:08:43,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-11-07 01:08:43,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-11-07 01:08:43,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-11-07 01:08:43,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-11-07 01:08:43,828 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-11-07 01:08:43,829 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-11-07 01:08:43,829 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-11-07 01:08:43,830 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-11-07 01:08:43,830 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-11-07 01:08:43,830 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-11-07 01:08:43,830 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-11-07 01:08:43,831 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-11-07 01:08:43,832 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-11-07 01:08:43,832 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-11-07 01:08:45,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:08:45,067 INFO L299 CfgBuilder]: Removed 275 assume(true) statements. [2021-11-07 01:08:45,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:45 BoogieIcfgContainer [2021-11-07 01:08:45,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:08:45,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:08:45,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:08:45,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:08:45,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:08:41" (1/3) ... [2021-11-07 01:08:45,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a51a21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:08:45, skipping insertion in model container [2021-11-07 01:08:45,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:08:41" (2/3) ... [2021-11-07 01:08:45,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a51a21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:08:45, skipping insertion in model container [2021-11-07 01:08:45,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:45" (3/3) ... [2021-11-07 01:08:45,081 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-11-07 01:08:45,087 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:08:45,087 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2021-11-07 01:08:45,145 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:08:45,151 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:08:45,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2021-11-07 01:08:45,178 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-11-07 01:08:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:08:45,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:45,185 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:08:45,185 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-11-07 01:08:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash 3916932, now seen corresponding path program 1 times [2021-11-07 01:08:45,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:45,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585873200] [2021-11-07 01:08:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:45,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:45,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-11-07 01:08:45,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:45,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585873200] [2021-11-07 01:08:45,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585873200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:45,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:45,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:45,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023982942] [2021-11-07 01:08:45,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:45,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:45,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:45,447 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-11-07 01:08:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:45,821 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2021-11-07 01:08:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-07 01:08:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:45,849 INFO L225 Difference]: With dead ends: 637 [2021-11-07 01:08:45,850 INFO L226 Difference]: Without dead ends: 359 [2021-11-07 01:08:45,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-11-07 01:08:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2021-11-07 01:08:45,923 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-11-07 01:08:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2021-11-07 01:08:45,927 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2021-11-07 01:08:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:45,928 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2021-11-07 01:08:45,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2021-11-07 01:08:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:08:45,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:45,929 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:45,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:08:45,930 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-11-07 01:08:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1581488811, now seen corresponding path program 1 times [2021-11-07 01:08:45,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:45,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049532553] [2021-11-07 01:08:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:45,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:46,050 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:46,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049532553] [2021-11-07 01:08:46,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049532553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:46,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:46,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:08:46,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239532529] [2021-11-07 01:08:46,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:46,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:46,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,057 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-11-07 01:08:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:46,094 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2021-11-07 01:08:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:46,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:08:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:46,098 INFO L225 Difference]: With dead ends: 378 [2021-11-07 01:08:46,099 INFO L226 Difference]: Without dead ends: 358 [2021-11-07 01:08:46,100 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-07 01:08:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2021-11-07 01:08:46,157 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-11-07 01:08:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 479 transitions. [2021-11-07 01:08:46,159 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 479 transitions. Word has length 10 [2021-11-07 01:08:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:46,159 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 479 transitions. [2021-11-07 01:08:46,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 479 transitions. [2021-11-07 01:08:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:08:46,161 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:46,161 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:46,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:08:46,162 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-11-07 01:08:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1365717038, now seen corresponding path program 1 times [2021-11-07 01:08:46,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:46,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247973705] [2021-11-07 01:08:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:46,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:46,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:46,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247973705] [2021-11-07 01:08:46,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247973705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:46,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:46,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:46,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708385030] [2021-11-07 01:08:46,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:46,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,326 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-11-07 01:08:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:46,362 INFO L93 Difference]: Finished difference Result 431 states and 575 transitions. [2021-11-07 01:08:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:46,363 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-11-07 01:08:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:46,366 INFO L225 Difference]: With dead ends: 431 [2021-11-07 01:08:46,367 INFO L226 Difference]: Without dead ends: 397 [2021-11-07 01:08:46,367 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-11-07 01:08:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 373. [2021-11-07 01:08:46,384 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-11-07 01:08:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 509 transitions. [2021-11-07 01:08:46,386 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 509 transitions. Word has length 11 [2021-11-07 01:08:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:46,386 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 509 transitions. [2021-11-07 01:08:46,386 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-11-07 01:08:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 509 transitions. [2021-11-07 01:08:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:08:46,388 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:46,388 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:46,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:08:46,389 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-11-07 01:08:46,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash -698114258, now seen corresponding path program 1 times [2021-11-07 01:08:46,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:46,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930286994] [2021-11-07 01:08:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:46,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:46,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:46,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930286994] [2021-11-07 01:08:46,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930286994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:46,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:46,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:46,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810620063] [2021-11-07 01:08:46,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:46,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:46,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:46,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,442 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-11-07 01:08:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:46,501 INFO L93 Difference]: Finished difference Result 611 states and 816 transitions. [2021-11-07 01:08:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:46,502 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-11-07 01:08:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:46,505 INFO L225 Difference]: With dead ends: 611 [2021-11-07 01:08:46,505 INFO L226 Difference]: Without dead ends: 435 [2021-11-07 01:08:46,507 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-11-07 01:08:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 351. [2021-11-07 01:08:46,525 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-11-07 01:08:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2021-11-07 01:08:46,527 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 12 [2021-11-07 01:08:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:46,527 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2021-11-07 01:08:46,528 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-11-07 01:08:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2021-11-07 01:08:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:08:46,529 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:46,530 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:46,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:08:46,530 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-11-07 01:08:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash 968473548, now seen corresponding path program 1 times [2021-11-07 01:08:46,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:46,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555876541] [2021-11-07 01:08:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:46,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:46,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:46,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555876541] [2021-11-07 01:08:46,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555876541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:46,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:46,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:46,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280031429] [2021-11-07 01:08:46,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:46,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,567 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-11-07 01:08:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:46,717 INFO L93 Difference]: Finished difference Result 375 states and 503 transitions. [2021-11-07 01:08:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:46,718 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-11-07 01:08:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:46,720 INFO L225 Difference]: With dead ends: 375 [2021-11-07 01:08:46,720 INFO L226 Difference]: Without dead ends: 357 [2021-11-07 01:08:46,721 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-07 01:08:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-11-07 01:08:46,742 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-11-07 01:08:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2021-11-07 01:08:46,744 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 14 [2021-11-07 01:08:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:46,744 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2021-11-07 01:08:46,745 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-11-07 01:08:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2021-11-07 01:08:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:08:46,751 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:46,751 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:46,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:08:46,752 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-11-07 01:08:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1947817000, now seen corresponding path program 1 times [2021-11-07 01:08:46,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:46,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930899231] [2021-11-07 01:08:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:46,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:46,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:46,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930899231] [2021-11-07 01:08:46,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930899231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:46,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:46,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:46,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808427749] [2021-11-07 01:08:46,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:46,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,835 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-11-07 01:08:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:46,976 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2021-11-07 01:08:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-07 01:08:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:46,979 INFO L225 Difference]: With dead ends: 357 [2021-11-07 01:08:46,979 INFO L226 Difference]: Without dead ends: 341 [2021-11-07 01:08:46,980 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-07 01:08:46,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-11-07 01:08:46,999 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-11-07 01:08:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2021-11-07 01:08:47,000 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2021-11-07 01:08:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:47,001 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2021-11-07 01:08:47,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2021-11-07 01:08:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 01:08:47,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:47,003 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:47,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:08:47,004 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-11-07 01:08:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 670796967, now seen corresponding path program 1 times [2021-11-07 01:08:47,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:47,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588379758] [2021-11-07 01:08:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:47,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:47,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:47,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588379758] [2021-11-07 01:08:47,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588379758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:47,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:47,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:47,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540284137] [2021-11-07 01:08:47,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:47,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:47,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:47,083 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-11-07 01:08:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:47,128 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2021-11-07 01:08:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:47,129 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-11-07 01:08:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:47,132 INFO L225 Difference]: With dead ends: 425 [2021-11-07 01:08:47,132 INFO L226 Difference]: Without dead ends: 389 [2021-11-07 01:08:47,133 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-07 01:08:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 328. [2021-11-07 01:08:47,167 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-11-07 01:08:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 443 transitions. [2021-11-07 01:08:47,169 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 443 transitions. Word has length 19 [2021-11-07 01:08:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:47,170 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 443 transitions. [2021-11-07 01:08:47,170 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-11-07 01:08:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 443 transitions. [2021-11-07 01:08:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:08:47,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:47,172 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:47,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:08:47,172 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-11-07 01:08:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 276863221, now seen corresponding path program 1 times [2021-11-07 01:08:47,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:47,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317516532] [2021-11-07 01:08:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:47,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:47,241 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:47,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317516532] [2021-11-07 01:08:47,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317516532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:47,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:47,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:47,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685777809] [2021-11-07 01:08:47,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:47,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:47,244 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-11-07 01:08:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:47,365 INFO L93 Difference]: Finished difference Result 428 states and 576 transitions. [2021-11-07 01:08:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-07 01:08:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:47,368 INFO L225 Difference]: With dead ends: 428 [2021-11-07 01:08:47,369 INFO L226 Difference]: Without dead ends: 325 [2021-11-07 01:08:47,369 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-07 01:08:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-11-07 01:08:47,390 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-11-07 01:08:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 439 transitions. [2021-11-07 01:08:47,392 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 439 transitions. Word has length 20 [2021-11-07 01:08:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:47,393 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 439 transitions. [2021-11-07 01:08:47,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 439 transitions. [2021-11-07 01:08:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:08:47,394 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:47,394 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:47,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:08:47,395 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-11-07 01:08:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1071552806, now seen corresponding path program 1 times [2021-11-07 01:08:47,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:47,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904805292] [2021-11-07 01:08:47,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:47,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:47,476 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:47,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904805292] [2021-11-07 01:08:47,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904805292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:47,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:47,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:47,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143380428] [2021-11-07 01:08:47,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:47,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:47,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:47,483 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-11-07 01:08:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:47,629 INFO L93 Difference]: Finished difference Result 330 states and 443 transitions. [2021-11-07 01:08:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:47,630 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-11-07 01:08:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:47,632 INFO L225 Difference]: With dead ends: 330 [2021-11-07 01:08:47,633 INFO L226 Difference]: Without dead ends: 325 [2021-11-07 01:08:47,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-07 01:08:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-11-07 01:08:47,652 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-11-07 01:08:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 438 transitions. [2021-11-07 01:08:47,654 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 438 transitions. Word has length 20 [2021-11-07 01:08:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:47,654 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 438 transitions. [2021-11-07 01:08:47,655 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-11-07 01:08:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 438 transitions. [2021-11-07 01:08:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:08:47,656 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:47,656 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:47,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:08:47,656 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-11-07 01:08:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2030436846, now seen corresponding path program 1 times [2021-11-07 01:08:47,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:47,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356980725] [2021-11-07 01:08:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:47,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:47,705 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:47,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356980725] [2021-11-07 01:08:47,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356980725] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:47,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:47,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:47,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509281118] [2021-11-07 01:08:47,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:47,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:47,709 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-11-07 01:08:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:47,757 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2021-11-07 01:08:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:47,757 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-11-07 01:08:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:47,759 INFO L225 Difference]: With dead ends: 418 [2021-11-07 01:08:47,759 INFO L226 Difference]: Without dead ends: 323 [2021-11-07 01:08:47,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-07 01:08:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2021-11-07 01:08:47,779 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-11-07 01:08:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2021-11-07 01:08:47,780 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 21 [2021-11-07 01:08:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:47,782 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2021-11-07 01:08:47,782 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-11-07 01:08:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2021-11-07 01:08:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:08:47,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:47,784 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:47,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:08:47,785 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-11-07 01:08:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 612333619, now seen corresponding path program 1 times [2021-11-07 01:08:47,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:47,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533775294] [2021-11-07 01:08:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:47,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:47,844 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:47,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533775294] [2021-11-07 01:08:47,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533775294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:47,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:47,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:47,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012761737] [2021-11-07 01:08:47,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:47,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:47,847 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-11-07 01:08:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:48,024 INFO L93 Difference]: Finished difference Result 314 states and 415 transitions. [2021-11-07 01:08:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:08:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:48,027 INFO L225 Difference]: With dead ends: 314 [2021-11-07 01:08:48,027 INFO L226 Difference]: Without dead ends: 309 [2021-11-07 01:08:48,027 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-11-07 01:08:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-11-07 01:08:48,048 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-11-07 01:08:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 410 transitions. [2021-11-07 01:08:48,049 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 410 transitions. Word has length 21 [2021-11-07 01:08:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:48,050 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 410 transitions. [2021-11-07 01:08:48,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 410 transitions. [2021-11-07 01:08:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:08:48,051 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:48,051 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:48,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:08:48,052 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-11-07 01:08:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1058451947, now seen corresponding path program 1 times [2021-11-07 01:08:48,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:48,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947328954] [2021-11-07 01:08:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:48,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:48,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:48,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947328954] [2021-11-07 01:08:48,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947328954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:48,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:48,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:48,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467715425] [2021-11-07 01:08:48,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:48,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:48,113 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-11-07 01:08:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:48,146 INFO L93 Difference]: Finished difference Result 349 states and 455 transitions. [2021-11-07 01:08:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:48,146 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-11-07 01:08:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:48,150 INFO L225 Difference]: With dead ends: 349 [2021-11-07 01:08:48,150 INFO L226 Difference]: Without dead ends: 295 [2021-11-07 01:08:48,150 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-07 01:08:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2021-11-07 01:08:48,171 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-11-07 01:08:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 385 transitions. [2021-11-07 01:08:48,173 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 385 transitions. Word has length 21 [2021-11-07 01:08:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:48,173 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 385 transitions. [2021-11-07 01:08:48,173 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-11-07 01:08:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 385 transitions. [2021-11-07 01:08:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:08:48,174 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:48,175 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:48,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:08:48,175 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-11-07 01:08:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -420836383, now seen corresponding path program 1 times [2021-11-07 01:08:48,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:48,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539784993] [2021-11-07 01:08:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:48,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:48,205 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:48,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539784993] [2021-11-07 01:08:48,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539784993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:48,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:48,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:48,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398903032] [2021-11-07 01:08:48,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:48,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:48,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:48,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:48,208 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-11-07 01:08:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:48,347 INFO L93 Difference]: Finished difference Result 344 states and 448 transitions. [2021-11-07 01:08:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:08:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:48,349 INFO L225 Difference]: With dead ends: 344 [2021-11-07 01:08:48,350 INFO L226 Difference]: Without dead ends: 336 [2021-11-07 01:08:48,350 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-07 01:08:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2021-11-07 01:08:48,370 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-11-07 01:08:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2021-11-07 01:08:48,372 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 22 [2021-11-07 01:08:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:48,372 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2021-11-07 01:08:48,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2021-11-07 01:08:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:08:48,373 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:48,374 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:48,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:08:48,374 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-11-07 01:08:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1442209585, now seen corresponding path program 1 times [2021-11-07 01:08:48,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:48,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997173547] [2021-11-07 01:08:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:48,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:48,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:48,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997173547] [2021-11-07 01:08:48,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997173547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:48,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:48,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:48,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369708656] [2021-11-07 01:08:48,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:48,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:48,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:48,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:48,409 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-11-07 01:08:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:48,459 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2021-11-07 01:08:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:48,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:08:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:48,462 INFO L225 Difference]: With dead ends: 314 [2021-11-07 01:08:48,462 INFO L226 Difference]: Without dead ends: 299 [2021-11-07 01:08:48,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-07 01:08:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-11-07 01:08:48,485 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-11-07 01:08:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 394 transitions. [2021-11-07 01:08:48,487 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 394 transitions. Word has length 22 [2021-11-07 01:08:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:48,487 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 394 transitions. [2021-11-07 01:08:48,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 394 transitions. [2021-11-07 01:08:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:08:48,489 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:48,489 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:48,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:08:48,490 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-11-07 01:08:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 375582176, now seen corresponding path program 1 times [2021-11-07 01:08:48,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:48,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240378565] [2021-11-07 01:08:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:48,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:48,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:48,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240378565] [2021-11-07 01:08:48,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240378565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:48,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:48,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:48,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222221760] [2021-11-07 01:08:48,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:48,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:48,537 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-11-07 01:08:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:48,599 INFO L93 Difference]: Finished difference Result 337 states and 433 transitions. [2021-11-07 01:08:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:08:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:48,603 INFO L225 Difference]: With dead ends: 337 [2021-11-07 01:08:48,603 INFO L226 Difference]: Without dead ends: 316 [2021-11-07 01:08:48,604 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-07 01:08:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2021-11-07 01:08:48,628 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-11-07 01:08:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 396 transitions. [2021-11-07 01:08:48,630 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 396 transitions. Word has length 22 [2021-11-07 01:08:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:48,630 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 396 transitions. [2021-11-07 01:08:48,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 396 transitions. [2021-11-07 01:08:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:08:48,632 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:48,632 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:48,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:08:48,633 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-11-07 01:08:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash 638524463, now seen corresponding path program 1 times [2021-11-07 01:08:48,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:48,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408095395] [2021-11-07 01:08:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:48,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:48,674 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:48,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408095395] [2021-11-07 01:08:48,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408095395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:48,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:48,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:48,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112231786] [2021-11-07 01:08:48,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:48,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:48,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:48,677 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-11-07 01:08:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:48,732 INFO L93 Difference]: Finished difference Result 314 states and 408 transitions. [2021-11-07 01:08:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 01:08:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:48,735 INFO L225 Difference]: With dead ends: 314 [2021-11-07 01:08:48,735 INFO L226 Difference]: Without dead ends: 299 [2021-11-07 01:08:48,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-07 01:08:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-11-07 01:08:48,784 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-11-07 01:08:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2021-11-07 01:08:48,788 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 22 [2021-11-07 01:08:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:48,789 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2021-11-07 01:08:48,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2021-11-07 01:08:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:08:48,790 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:48,790 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:48,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:08:48,791 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-11-07 01:08:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash -168683918, now seen corresponding path program 1 times [2021-11-07 01:08:48,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:48,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469470883] [2021-11-07 01:08:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:48,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:48,849 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:48,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469470883] [2021-11-07 01:08:48,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469470883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:48,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:48,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:48,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868450567] [2021-11-07 01:08:48,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:48,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:48,852 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-11-07 01:08:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:49,061 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2021-11-07 01:08:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-07 01:08:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:49,065 INFO L225 Difference]: With dead ends: 341 [2021-11-07 01:08:49,065 INFO L226 Difference]: Without dead ends: 314 [2021-11-07 01:08:49,066 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-11-07 01:08:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2021-11-07 01:08:49,092 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-11-07 01:08:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2021-11-07 01:08:49,094 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 23 [2021-11-07 01:08:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:49,095 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2021-11-07 01:08:49,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2021-11-07 01:08:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 01:08:49,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:49,096 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:49,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:08:49,097 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-11-07 01:08:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:49,097 INFO L85 PathProgramCache]: Analyzing trace with hash -130301320, now seen corresponding path program 1 times [2021-11-07 01:08:49,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:49,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458749725] [2021-11-07 01:08:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:49,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:49,139 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:49,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458749725] [2021-11-07 01:08:49,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458749725] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:49,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:49,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:49,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175540447] [2021-11-07 01:08:49,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:49,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:49,143 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-11-07 01:08:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:49,190 INFO L93 Difference]: Finished difference Result 411 states and 527 transitions. [2021-11-07 01:08:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:49,191 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-11-07 01:08:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:49,193 INFO L225 Difference]: With dead ends: 411 [2021-11-07 01:08:49,193 INFO L226 Difference]: Without dead ends: 317 [2021-11-07 01:08:49,194 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-07 01:08:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2021-11-07 01:08:49,217 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-11-07 01:08:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 367 transitions. [2021-11-07 01:08:49,219 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 367 transitions. Word has length 23 [2021-11-07 01:08:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:49,219 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 367 transitions. [2021-11-07 01:08:49,219 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-11-07 01:08:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 367 transitions. [2021-11-07 01:08:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:08:49,220 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:49,221 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:49,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:08:49,223 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-11-07 01:08:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -662751181, now seen corresponding path program 1 times [2021-11-07 01:08:49,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:49,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040238460] [2021-11-07 01:08:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:49,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:49,404 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:49,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040238460] [2021-11-07 01:08:49,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040238460] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:49,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:49,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:49,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529912197] [2021-11-07 01:08:49,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:49,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:49,407 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-11-07 01:08:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:49,474 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2021-11-07 01:08:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:49,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:08:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:49,476 INFO L225 Difference]: With dead ends: 382 [2021-11-07 01:08:49,477 INFO L226 Difference]: Without dead ends: 284 [2021-11-07 01:08:49,477 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-07 01:08:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 270. [2021-11-07 01:08:49,508 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-11-07 01:08:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 349 transitions. [2021-11-07 01:08:49,509 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 349 transitions. Word has length 24 [2021-11-07 01:08:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:49,510 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 349 transitions. [2021-11-07 01:08:49,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 349 transitions. [2021-11-07 01:08:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:08:49,511 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:49,511 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:49,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 01:08:49,512 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-11-07 01:08:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1269559156, now seen corresponding path program 1 times [2021-11-07 01:08:49,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:49,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074779873] [2021-11-07 01:08:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:49,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:49,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:49,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074779873] [2021-11-07 01:08:49,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074779873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:49,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:49,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:49,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267670958] [2021-11-07 01:08:49,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:49,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:49,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:49,546 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-11-07 01:08:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:49,703 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2021-11-07 01:08:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:49,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:08:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:49,707 INFO L225 Difference]: With dead ends: 360 [2021-11-07 01:08:49,707 INFO L226 Difference]: Without dead ends: 340 [2021-11-07 01:08:49,708 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-07 01:08:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-11-07 01:08:49,764 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-11-07 01:08:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 365 transitions. [2021-11-07 01:08:49,766 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 365 transitions. Word has length 24 [2021-11-07 01:08:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:49,766 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 365 transitions. [2021-11-07 01:08:49,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 365 transitions. [2021-11-07 01:08:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:08:49,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:49,768 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:49,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 01:08:49,768 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-11-07 01:08:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1364391258, now seen corresponding path program 1 times [2021-11-07 01:08:49,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:49,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154341880] [2021-11-07 01:08:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:49,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:49,818 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:49,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154341880] [2021-11-07 01:08:49,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154341880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:49,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:49,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:49,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877520626] [2021-11-07 01:08:49,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:49,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:49,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:49,823 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-11-07 01:08:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:49,888 INFO L93 Difference]: Finished difference Result 299 states and 377 transitions. [2021-11-07 01:08:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-07 01:08:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:49,890 INFO L225 Difference]: With dead ends: 299 [2021-11-07 01:08:49,891 INFO L226 Difference]: Without dead ends: 282 [2021-11-07 01:08:49,891 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-07 01:08:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-11-07 01:08:49,917 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-11-07 01:08:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2021-11-07 01:08:49,918 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 24 [2021-11-07 01:08:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:49,919 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2021-11-07 01:08:49,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2021-11-07 01:08:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:08:49,920 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:49,920 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:49,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 01:08:49,921 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-11-07 01:08:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash -896029021, now seen corresponding path program 1 times [2021-11-07 01:08:49,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:49,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974221031] [2021-11-07 01:08:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:49,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:50,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:50,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974221031] [2021-11-07 01:08:50,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974221031] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:50,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:50,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:50,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914919759] [2021-11-07 01:08:50,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:50,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:50,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:50,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:50,010 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-11-07 01:08:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:50,167 INFO L93 Difference]: Finished difference Result 368 states and 467 transitions. [2021-11-07 01:08:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:08:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:50,169 INFO L225 Difference]: With dead ends: 368 [2021-11-07 01:08:50,170 INFO L226 Difference]: Without dead ends: 282 [2021-11-07 01:08:50,170 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-07 01:08:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-11-07 01:08:50,198 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-11-07 01:08:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 357 transitions. [2021-11-07 01:08:50,199 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 357 transitions. Word has length 25 [2021-11-07 01:08:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:50,200 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 357 transitions. [2021-11-07 01:08:50,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 357 transitions. [2021-11-07 01:08:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:08:50,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:50,201 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:50,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 01:08:50,202 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-11-07 01:08:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash 719084810, now seen corresponding path program 1 times [2021-11-07 01:08:50,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:50,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019473599] [2021-11-07 01:08:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:50,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:50,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:50,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019473599] [2021-11-07 01:08:50,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019473599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:50,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:50,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:50,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278853688] [2021-11-07 01:08:50,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:50,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:50,265 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-11-07 01:08:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:50,416 INFO L93 Difference]: Finished difference Result 287 states and 362 transitions. [2021-11-07 01:08:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:08:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:50,419 INFO L225 Difference]: With dead ends: 287 [2021-11-07 01:08:50,420 INFO L226 Difference]: Without dead ends: 284 [2021-11-07 01:08:50,420 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-07 01:08:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-11-07 01:08:50,448 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-11-07 01:08:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2021-11-07 01:08:50,450 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 25 [2021-11-07 01:08:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:50,450 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2021-11-07 01:08:50,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2021-11-07 01:08:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:08:50,451 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:50,451 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:50,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 01:08:50,452 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-11-07 01:08:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash 719096726, now seen corresponding path program 1 times [2021-11-07 01:08:50,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:50,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068575727] [2021-11-07 01:08:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:50,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:50,504 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:50,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068575727] [2021-11-07 01:08:50,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068575727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:50,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:50,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:50,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694328197] [2021-11-07 01:08:50,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:50,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:50,508 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-11-07 01:08:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:50,689 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-11-07 01:08:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:08:50,690 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-11-07 01:08:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:50,692 INFO L225 Difference]: With dead ends: 342 [2021-11-07 01:08:50,692 INFO L226 Difference]: Without dead ends: 328 [2021-11-07 01:08:50,693 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-11-07 01:08:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2021-11-07 01:08:50,744 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-11-07 01:08:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 362 transitions. [2021-11-07 01:08:50,745 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 362 transitions. Word has length 25 [2021-11-07 01:08:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:50,745 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 362 transitions. [2021-11-07 01:08:50,746 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-11-07 01:08:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 362 transitions. [2021-11-07 01:08:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:08:50,747 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:50,747 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:50,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 01:08:50,747 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-11-07 01:08:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1275592658, now seen corresponding path program 1 times [2021-11-07 01:08:50,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:50,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997372915] [2021-11-07 01:08:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:50,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:50,793 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:50,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997372915] [2021-11-07 01:08:50,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997372915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:50,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:50,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:50,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018127281] [2021-11-07 01:08:50,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:50,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:50,795 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-11-07 01:08:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:50,950 INFO L93 Difference]: Finished difference Result 337 states and 413 transitions. [2021-11-07 01:08:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:50,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:08:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:50,953 INFO L225 Difference]: With dead ends: 337 [2021-11-07 01:08:50,953 INFO L226 Difference]: Without dead ends: 288 [2021-11-07 01:08:50,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-07 01:08:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-07 01:08:50,988 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-11-07 01:08:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-11-07 01:08:50,990 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 25 [2021-11-07 01:08:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:50,991 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-11-07 01:08:50,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-11-07 01:08:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:08:50,992 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:50,993 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:50,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 01:08:50,993 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-11-07 01:08:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 513282031, now seen corresponding path program 1 times [2021-11-07 01:08:50,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:50,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262707467] [2021-11-07 01:08:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:50,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:51,064 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:51,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262707467] [2021-11-07 01:08:51,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262707467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:51,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:51,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:51,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757197895] [2021-11-07 01:08:51,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:51,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:51,068 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-11-07 01:08:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:51,308 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2021-11-07 01:08:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:08:51,309 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-11-07 01:08:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:51,312 INFO L225 Difference]: With dead ends: 342 [2021-11-07 01:08:51,312 INFO L226 Difference]: Without dead ends: 338 [2021-11-07 01:08:51,312 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-07 01:08:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2021-11-07 01:08:51,344 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-11-07 01:08:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 354 transitions. [2021-11-07 01:08:51,345 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 354 transitions. Word has length 26 [2021-11-07 01:08:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:51,346 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 354 transitions. [2021-11-07 01:08:51,346 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-11-07 01:08:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 354 transitions. [2021-11-07 01:08:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:08:51,347 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:51,347 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:51,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 01:08:51,348 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-11-07 01:08:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1329987784, now seen corresponding path program 1 times [2021-11-07 01:08:51,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:51,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686683091] [2021-11-07 01:08:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:51,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:51,424 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:51,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686683091] [2021-11-07 01:08:51,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686683091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:51,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:51,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:08:51,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284824978] [2021-11-07 01:08:51,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:08:51,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:51,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:08:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:51,427 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-11-07 01:08:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:51,599 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2021-11-07 01:08:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:08:51,600 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-11-07 01:08:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:51,602 INFO L225 Difference]: With dead ends: 321 [2021-11-07 01:08:51,602 INFO L226 Difference]: Without dead ends: 303 [2021-11-07 01:08:51,603 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:08:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-07 01:08:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2021-11-07 01:08:51,635 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-11-07 01:08:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2021-11-07 01:08:51,636 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 26 [2021-11-07 01:08:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:51,637 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2021-11-07 01:08:51,637 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-11-07 01:08:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2021-11-07 01:08:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 01:08:51,638 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:51,638 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:51,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 01:08:51,638 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-11-07 01:08:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -937040231, now seen corresponding path program 1 times [2021-11-07 01:08:51,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:51,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11217059] [2021-11-07 01:08:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:51,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:51,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:51,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11217059] [2021-11-07 01:08:51,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11217059] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:51,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:51,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:51,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308740495] [2021-11-07 01:08:51,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:08:51,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:08:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:51,687 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-11-07 01:08:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:51,794 INFO L93 Difference]: Finished difference Result 311 states and 364 transitions. [2021-11-07 01:08:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:08:51,795 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-11-07 01:08:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:51,797 INFO L225 Difference]: With dead ends: 311 [2021-11-07 01:08:51,797 INFO L226 Difference]: Without dead ends: 269 [2021-11-07 01:08:51,797 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:08:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-07 01:08:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2021-11-07 01:08:51,831 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-11-07 01:08:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2021-11-07 01:08:51,832 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 26 [2021-11-07 01:08:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:51,833 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2021-11-07 01:08:51,833 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-11-07 01:08:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2021-11-07 01:08:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:08:51,835 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:51,835 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:51,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 01:08:51,835 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-11-07 01:08:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1033980549, now seen corresponding path program 1 times [2021-11-07 01:08:51,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:51,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812691957] [2021-11-07 01:08:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:51,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:51,888 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:51,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812691957] [2021-11-07 01:08:51,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812691957] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:51,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:51,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:51,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247421563] [2021-11-07 01:08:51,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:51,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:51,891 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-11-07 01:08:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:52,032 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2021-11-07 01:08:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:52,033 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-11-07 01:08:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:52,035 INFO L225 Difference]: With dead ends: 266 [2021-11-07 01:08:52,035 INFO L226 Difference]: Without dead ends: 237 [2021-11-07 01:08:52,036 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-07 01:08:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2021-11-07 01:08:52,066 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-11-07 01:08:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2021-11-07 01:08:52,067 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 27 [2021-11-07 01:08:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:52,067 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2021-11-07 01:08:52,068 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-11-07 01:08:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2021-11-07 01:08:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 01:08:52,069 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:52,069 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:52,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 01:08:52,069 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-11-07 01:08:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash -835413411, now seen corresponding path program 1 times [2021-11-07 01:08:52,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:52,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749021041] [2021-11-07 01:08:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:52,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:52,104 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:52,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749021041] [2021-11-07 01:08:52,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749021041] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:52,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:52,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:52,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109862117] [2021-11-07 01:08:52,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:52,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:52,107 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-11-07 01:08:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:52,219 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2021-11-07 01:08:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:52,219 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-11-07 01:08:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:52,221 INFO L225 Difference]: With dead ends: 243 [2021-11-07 01:08:52,221 INFO L226 Difference]: Without dead ends: 238 [2021-11-07 01:08:52,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-07 01:08:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2021-11-07 01:08:52,251 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-11-07 01:08:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-11-07 01:08:52,252 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-11-07 01:08:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:52,252 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-11-07 01:08:52,253 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-11-07 01:08:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-11-07 01:08:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 01:08:52,254 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:52,254 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:52,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 01:08:52,255 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-11-07 01:08:52,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash -336964878, now seen corresponding path program 1 times [2021-11-07 01:08:52,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:52,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109671836] [2021-11-07 01:08:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:52,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:52,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:52,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109671836] [2021-11-07 01:08:52,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109671836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:52,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:52,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:52,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272797065] [2021-11-07 01:08:52,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:52,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:52,310 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-11-07 01:08:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:52,525 INFO L93 Difference]: Finished difference Result 263 states and 314 transitions. [2021-11-07 01:08:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:52,526 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-11-07 01:08:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:52,528 INFO L225 Difference]: With dead ends: 263 [2021-11-07 01:08:52,528 INFO L226 Difference]: Without dead ends: 261 [2021-11-07 01:08:52,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-07 01:08:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2021-11-07 01:08:52,591 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-11-07 01:08:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2021-11-07 01:08:52,593 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 28 [2021-11-07 01:08:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:52,594 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2021-11-07 01:08:52,594 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-11-07 01:08:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2021-11-07 01:08:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:08:52,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:52,596 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:52,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 01:08:52,597 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-11-07 01:08:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2033165494, now seen corresponding path program 1 times [2021-11-07 01:08:52,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:52,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724512308] [2021-11-07 01:08:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:52,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:52,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:52,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724512308] [2021-11-07 01:08:52,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724512308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:52,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:52,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:52,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667504842] [2021-11-07 01:08:52,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:52,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:52,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:52,655 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-11-07 01:08:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:52,748 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2021-11-07 01:08:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:52,748 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-11-07 01:08:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:52,750 INFO L225 Difference]: With dead ends: 247 [2021-11-07 01:08:52,750 INFO L226 Difference]: Without dead ends: 226 [2021-11-07 01:08:52,751 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-07 01:08:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-11-07 01:08:52,789 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-11-07 01:08:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 270 transitions. [2021-11-07 01:08:52,790 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 270 transitions. Word has length 29 [2021-11-07 01:08:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:52,791 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 270 transitions. [2021-11-07 01:08:52,791 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-11-07 01:08:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 270 transitions. [2021-11-07 01:08:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:08:52,792 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:52,793 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:52,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 01:08:52,793 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-11-07 01:08:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -657637208, now seen corresponding path program 1 times [2021-11-07 01:08:52,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:52,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019856476] [2021-11-07 01:08:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:52,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:52,829 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:52,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019856476] [2021-11-07 01:08:52,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019856476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:52,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:52,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:08:52,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665867244] [2021-11-07 01:08:52,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:52,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:52,831 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-11-07 01:08:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:52,951 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2021-11-07 01:08:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:52,952 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-11-07 01:08:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:52,953 INFO L225 Difference]: With dead ends: 231 [2021-11-07 01:08:52,953 INFO L226 Difference]: Without dead ends: 213 [2021-11-07 01:08:52,954 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-07 01:08:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-11-07 01:08:52,981 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-11-07 01:08:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2021-11-07 01:08:52,982 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 29 [2021-11-07 01:08:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:52,983 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2021-11-07 01:08:52,983 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-11-07 01:08:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2021-11-07 01:08:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:08:52,984 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:52,984 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:52,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 01:08:52,985 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-11-07 01:08:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1797324549, now seen corresponding path program 1 times [2021-11-07 01:08:52,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:52,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265617099] [2021-11-07 01:08:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:52,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:53,020 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:53,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265617099] [2021-11-07 01:08:53,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265617099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:53,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:53,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:53,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135208730] [2021-11-07 01:08:53,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:53,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:53,023 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-11-07 01:08:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:53,080 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2021-11-07 01:08:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:53,080 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-11-07 01:08:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:53,082 INFO L225 Difference]: With dead ends: 237 [2021-11-07 01:08:53,082 INFO L226 Difference]: Without dead ends: 213 [2021-11-07 01:08:53,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-07 01:08:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-11-07 01:08:53,108 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-11-07 01:08:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 251 transitions. [2021-11-07 01:08:53,109 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 251 transitions. Word has length 29 [2021-11-07 01:08:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:53,110 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 251 transitions. [2021-11-07 01:08:53,110 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-11-07 01:08:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2021-11-07 01:08:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:08:53,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:53,111 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:53,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 01:08:53,112 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-11-07 01:08:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -505348968, now seen corresponding path program 1 times [2021-11-07 01:08:53,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:53,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754721950] [2021-11-07 01:08:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:53,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:53,165 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:53,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754721950] [2021-11-07 01:08:53,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754721950] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:53,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:53,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:53,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501567834] [2021-11-07 01:08:53,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:53,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:53,168 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-11-07 01:08:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:53,305 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2021-11-07 01:08:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:08:53,306 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-11-07 01:08:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:53,307 INFO L225 Difference]: With dead ends: 234 [2021-11-07 01:08:53,307 INFO L226 Difference]: Without dead ends: 213 [2021-11-07 01:08:53,308 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-07 01:08:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2021-11-07 01:08:53,335 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-11-07 01:08:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2021-11-07 01:08:53,337 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 30 [2021-11-07 01:08:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:53,337 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2021-11-07 01:08:53,337 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-11-07 01:08:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2021-11-07 01:08:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:08:53,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:53,338 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:53,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 01:08:53,339 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-11-07 01:08:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1799897054, now seen corresponding path program 1 times [2021-11-07 01:08:53,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:53,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250423700] [2021-11-07 01:08:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:53,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:53,411 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:53,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250423700] [2021-11-07 01:08:53,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250423700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:53,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:53,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:53,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647369738] [2021-11-07 01:08:53,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:53,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:53,413 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-11-07 01:08:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:53,574 INFO L93 Difference]: Finished difference Result 279 states and 334 transitions. [2021-11-07 01:08:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:08:53,575 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-11-07 01:08:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:53,577 INFO L225 Difference]: With dead ends: 279 [2021-11-07 01:08:53,577 INFO L226 Difference]: Without dead ends: 211 [2021-11-07 01:08:53,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-07 01:08:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2021-11-07 01:08:53,605 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-11-07 01:08:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2021-11-07 01:08:53,606 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 30 [2021-11-07 01:08:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:53,607 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2021-11-07 01:08:53,607 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-11-07 01:08:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2021-11-07 01:08:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 01:08:53,608 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:53,608 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:53,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 01:08:53,609 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-11-07 01:08:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash -138267735, now seen corresponding path program 1 times [2021-11-07 01:08:53,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:53,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620015571] [2021-11-07 01:08:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:53,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:53,650 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:53,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620015571] [2021-11-07 01:08:53,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620015571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:53,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:53,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:53,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777096261] [2021-11-07 01:08:53,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:53,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:53,653 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-11-07 01:08:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:53,699 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-11-07 01:08:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:53,699 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-11-07 01:08:53,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:53,700 INFO L225 Difference]: With dead ends: 203 [2021-11-07 01:08:53,701 INFO L226 Difference]: Without dead ends: 155 [2021-11-07 01:08:53,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-07 01:08:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-11-07 01:08:53,724 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-11-07 01:08:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-11-07 01:08:53,725 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 31 [2021-11-07 01:08:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:53,725 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-11-07 01:08:53,725 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-11-07 01:08:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-11-07 01:08:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 01:08:53,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:53,727 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:53,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 01:08:53,727 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-11-07 01:08:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 709117488, now seen corresponding path program 1 times [2021-11-07 01:08:53,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:53,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792010383] [2021-11-07 01:08:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:53,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:53,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:53,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792010383] [2021-11-07 01:08:53,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792010383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:53,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:53,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:53,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099393250] [2021-11-07 01:08:53,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:53,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:53,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:53,786 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-11-07 01:08:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:53,952 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2021-11-07 01:08:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:53,953 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-11-07 01:08:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:53,955 INFO L225 Difference]: With dead ends: 187 [2021-11-07 01:08:53,955 INFO L226 Difference]: Without dead ends: 163 [2021-11-07 01:08:53,955 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-07 01:08:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-11-07 01:08:53,978 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-11-07 01:08:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2021-11-07 01:08:53,979 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 32 [2021-11-07 01:08:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:53,980 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2021-11-07 01:08:53,980 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-11-07 01:08:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2021-11-07 01:08:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 01:08:53,981 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:53,981 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:53,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 01:08:53,981 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-11-07 01:08:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1394718914, now seen corresponding path program 1 times [2021-11-07 01:08:53,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:53,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200913554] [2021-11-07 01:08:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:53,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:54,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:54,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200913554] [2021-11-07 01:08:54,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200913554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:54,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:54,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:08:54,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270243820] [2021-11-07 01:08:54,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:08:54,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:08:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:54,059 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-11-07 01:08:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:54,227 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2021-11-07 01:08:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:08:54,228 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-11-07 01:08:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:54,229 INFO L225 Difference]: With dead ends: 164 [2021-11-07 01:08:54,230 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 01:08:54,230 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:08:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 01:08:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-11-07 01:08:54,247 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-11-07 01:08:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-11-07 01:08:54,248 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 33 [2021-11-07 01:08:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:54,248 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-11-07 01:08:54,248 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-11-07 01:08:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-11-07 01:08:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 01:08:54,249 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:54,249 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:54,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 01:08:54,250 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-11-07 01:08:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1245231514, now seen corresponding path program 1 times [2021-11-07 01:08:54,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:54,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677684284] [2021-11-07 01:08:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:54,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:54,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:54,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677684284] [2021-11-07 01:08:54,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677684284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:54,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:54,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:54,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358470429] [2021-11-07 01:08:54,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:54,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:54,308 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-11-07 01:08:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:54,421 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2021-11-07 01:08:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:54,422 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-11-07 01:08:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:54,423 INFO L225 Difference]: With dead ends: 134 [2021-11-07 01:08:54,423 INFO L226 Difference]: Without dead ends: 132 [2021-11-07 01:08:54,423 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-07 01:08:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2021-11-07 01:08:54,441 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-11-07 01:08:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2021-11-07 01:08:54,442 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 36 [2021-11-07 01:08:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:54,442 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2021-11-07 01:08:54,442 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-11-07 01:08:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2021-11-07 01:08:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 01:08:54,443 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:54,443 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:54,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 01:08:54,444 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-11-07 01:08:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 904695418, now seen corresponding path program 1 times [2021-11-07 01:08:54,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:54,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338898931] [2021-11-07 01:08:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:54,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:54,535 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:54,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338898931] [2021-11-07 01:08:54,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338898931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:54,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:54,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:08:54,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244236114] [2021-11-07 01:08:54,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:08:54,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:08:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:08:54,537 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-11-07 01:08:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:54,680 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2021-11-07 01:08:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:08:54,685 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-11-07 01:08:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:54,686 INFO L225 Difference]: With dead ends: 118 [2021-11-07 01:08:54,686 INFO L226 Difference]: Without dead ends: 102 [2021-11-07 01:08:54,687 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:08:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-07 01:08:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-11-07 01:08:54,707 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-11-07 01:08:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-11-07 01:08:54,707 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 40 [2021-11-07 01:08:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:54,708 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-11-07 01:08:54,708 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-11-07 01:08:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-11-07 01:08:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 01:08:54,709 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:54,709 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:54,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 01:08:54,710 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-11-07 01:08:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash 173896077, now seen corresponding path program 1 times [2021-11-07 01:08:54,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:54,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166001810] [2021-11-07 01:08:54,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:54,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:54,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:54,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166001810] [2021-11-07 01:08:54,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166001810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:54,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:54,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:08:54,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202764550] [2021-11-07 01:08:54,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:08:54,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:08:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:54,771 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-11-07 01:08:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:54,875 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2021-11-07 01:08:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:08:54,876 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-11-07 01:08:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:54,877 INFO L225 Difference]: With dead ends: 129 [2021-11-07 01:08:54,877 INFO L226 Difference]: Without dead ends: 111 [2021-11-07 01:08:54,877 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:08:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-07 01:08:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-11-07 01:08:54,898 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-11-07 01:08:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2021-11-07 01:08:54,899 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 40 [2021-11-07 01:08:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:54,899 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2021-11-07 01:08:54,899 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-11-07 01:08:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2021-11-07 01:08:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 01:08:54,900 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:54,900 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:54,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 01:08:54,901 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-11-07 01:08:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1032182008, now seen corresponding path program 1 times [2021-11-07 01:08:54,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:54,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642073056] [2021-11-07 01:08:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:54,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:54,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:54,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642073056] [2021-11-07 01:08:54,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642073056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:54,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:54,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:08:54,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498213144] [2021-11-07 01:08:54,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:08:54,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:08:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:54,964 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-11-07 01:08:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:55,083 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2021-11-07 01:08:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:08:55,083 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-11-07 01:08:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:55,084 INFO L225 Difference]: With dead ends: 168 [2021-11-07 01:08:55,085 INFO L226 Difference]: Without dead ends: 116 [2021-11-07 01:08:55,085 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-07 01:08:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2021-11-07 01:08:55,108 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-11-07 01:08:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-11-07 01:08:55,109 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2021-11-07 01:08:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:55,112 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-11-07 01:08:55,112 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-11-07 01:08:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-11-07 01:08:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:08:55,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:55,113 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:55,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 01:08:55,114 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-11-07 01:08:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1597143897, now seen corresponding path program 1 times [2021-11-07 01:08:55,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:55,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300083424] [2021-11-07 01:08:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:55,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:55,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:55,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300083424] [2021-11-07 01:08:55,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300083424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:55,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:55,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:08:55,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146839635] [2021-11-07 01:08:55,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:08:55,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:08:55,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:55,177 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-11-07 01:08:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:55,263 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-11-07 01:08:55,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:08:55,264 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-11-07 01:08:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:55,265 INFO L225 Difference]: With dead ends: 101 [2021-11-07 01:08:55,265 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 01:08:55,266 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:08:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 01:08:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-07 01:08:55,280 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-11-07 01:08:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-11-07 01:08:55,281 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 43 [2021-11-07 01:08:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:55,281 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-11-07 01:08:55,282 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-11-07 01:08:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-11-07 01:08:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 01:08:55,285 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:55,285 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:55,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 01:08:55,287 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-11-07 01:08:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1037680409, now seen corresponding path program 1 times [2021-11-07 01:08:55,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:55,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920377263] [2021-11-07 01:08:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:55,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:55,343 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:55,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920377263] [2021-11-07 01:08:55,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920377263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:55,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:55,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:08:55,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407007203] [2021-11-07 01:08:55,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:08:55,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:55,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:08:55,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:08:55,346 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-11-07 01:08:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:55,392 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2021-11-07 01:08:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:08:55,393 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-11-07 01:08:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:55,393 INFO L225 Difference]: With dead ends: 93 [2021-11-07 01:08:55,394 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 01:08:55,394 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:08:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 01:08:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-07 01:08:55,410 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-11-07 01:08:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-11-07 01:08:55,411 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2021-11-07 01:08:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:55,411 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-11-07 01:08:55,411 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-11-07 01:08:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-11-07 01:08:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 01:08:55,416 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:55,417 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:55,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 01:08:55,417 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-11-07 01:08:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1050287321, now seen corresponding path program 1 times [2021-11-07 01:08:55,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:55,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354727288] [2021-11-07 01:08:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:55,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:55,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:55,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354727288] [2021-11-07 01:08:55,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354727288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:55,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:55,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:08:55,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494009360] [2021-11-07 01:08:55,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:08:55,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:08:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:08:55,520 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-11-07 01:08:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:55,604 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-11-07 01:08:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:08:55,605 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-11-07 01:08:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:55,606 INFO L225 Difference]: With dead ends: 83 [2021-11-07 01:08:55,606 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 01:08:55,606 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:08:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 01:08:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-11-07 01:08:55,653 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-11-07 01:08:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-11-07 01:08:55,654 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 52 [2021-11-07 01:08:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:55,654 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-07 01:08:55,654 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-11-07 01:08:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-11-07 01:08:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 01:08:55,655 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:55,655 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:55,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-07 01:08:55,656 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-11-07 01:08:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1433729709, now seen corresponding path program 1 times [2021-11-07 01:08:55,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:55,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216353443] [2021-11-07 01:08:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:55,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:55,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-11-07 01:08:55,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:55,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216353443] [2021-11-07 01:08:55,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216353443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:55,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:55,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 01:08:55,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428606636] [2021-11-07 01:08:55,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 01:08:55,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 01:08:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-07 01:08:55,790 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-11-07 01:08:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:56,076 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-11-07 01:08:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:08:56,077 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-11-07 01:08:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:56,078 INFO L225 Difference]: With dead ends: 110 [2021-11-07 01:08:56,078 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 01:08:56,079 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:08:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 01:08:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-07 01:08:56,093 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-11-07 01:08:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-11-07 01:08:56,093 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 54 [2021-11-07 01:08:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:56,094 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-11-07 01:08:56,094 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-11-07 01:08:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-11-07 01:08:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-07 01:08:56,095 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:08:56,095 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:08:56,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-07 01:08:56,095 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-11-07 01:08:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:08:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash -481267565, now seen corresponding path program 1 times [2021-11-07 01:08:56,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:08:56,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843950186] [2021-11-07 01:08:56,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:08:56,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:08:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:08:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:08:56,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:08:56,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843950186] [2021-11-07 01:08:56,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843950186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:08:56,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:08:56,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 01:08:56,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53151267] [2021-11-07 01:08:56,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:08:56,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:08:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:08:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:08:56,246 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-11-07 01:08:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:08:56,446 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2021-11-07 01:08:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:08:56,446 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-11-07 01:08:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:08:56,446 INFO L225 Difference]: With dead ends: 77 [2021-11-07 01:08:56,447 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:08:56,447 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:08:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:08:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:08:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:08:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:08:56,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2021-11-07 01:08:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:08:56,448 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:08:56,449 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-11-07 01:08:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:08:56,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:08:56,451 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,452 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,452 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,452 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,452 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,452 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,454 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,455 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,456 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,457 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,458 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,458 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,458 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,458 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,458 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,461 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,461 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,461 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,461 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,461 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:08:56,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-07 01:08:56,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:08:56,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:56,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:57,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:08:58,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:09:08,309 INFO L857 garLoopResultBuilder]: For program point L1026-2(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,310 INFO L857 garLoopResultBuilder]: For program point L1026-4(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,310 INFO L857 garLoopResultBuilder]: For program point L1026-6(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,310 INFO L857 garLoopResultBuilder]: For program point L1026-8(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,310 INFO L857 garLoopResultBuilder]: For program point L1026-10(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,310 INFO L857 garLoopResultBuilder]: For program point L1026-12(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,311 INFO L857 garLoopResultBuilder]: For program point L1026-14(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,311 INFO L857 garLoopResultBuilder]: For program point L1026-16(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,311 INFO L857 garLoopResultBuilder]: For program point L1026-18(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,311 INFO L857 garLoopResultBuilder]: For program point L1026-20(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,311 INFO L857 garLoopResultBuilder]: For program point L236-1(lines 229 417) no Hoare annotation was computed. [2021-11-07 01:09:08,311 INFO L857 garLoopResultBuilder]: For program point L1297(lines 1297 1311) no Hoare annotation was computed. [2021-11-07 01:09:08,312 INFO L857 garLoopResultBuilder]: For program point L240(lines 240 246) no Hoare annotation was computed. [2021-11-07 01:09:08,312 INFO L857 garLoopResultBuilder]: For program point L637(lines 637 642) no Hoare annotation was computed. [2021-11-07 01:09:08,312 INFO L857 garLoopResultBuilder]: For program point L637-2(lines 637 642) no Hoare annotation was computed. [2021-11-07 01:09:08,312 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-11-07 01:09:08,313 INFO L857 garLoopResultBuilder]: For program point L1298(lines 1298 1304) no Hoare annotation was computed. [2021-11-07 01:09:08,313 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,313 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,313 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-11-07 01:09:08,313 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-11-07 01:09:08,314 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,314 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,314 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 383) no Hoare annotation was computed. [2021-11-07 01:09:08,314 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,314 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-11-07 01:09:08,315 INFO L857 garLoopResultBuilder]: For program point L512(lines 512 517) no Hoare annotation was computed. [2021-11-07 01:09:08,315 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-11-07 01:09:08,315 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-11-07 01:09:08,315 INFO L857 garLoopResultBuilder]: For program point L118-2(lines 110 158) no Hoare annotation was computed. [2021-11-07 01:09:08,316 INFO L857 garLoopResultBuilder]: For program point L1043(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,316 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-11-07 01:09:08,316 INFO L857 garLoopResultBuilder]: For program point L1043-2(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,316 INFO L857 garLoopResultBuilder]: For program point L118-5(lines 110 158) no Hoare annotation was computed. [2021-11-07 01:09:08,316 INFO L857 garLoopResultBuilder]: For program point L1043-4(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,316 INFO L857 garLoopResultBuilder]: For program point L1043-6(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point L1043-8(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point L1043-10(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point L1043-12(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point L1043-14(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point L1043-16(lines 1043 1049) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2021-11-07 01:09:08,317 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,318 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,318 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,318 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,318 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,319 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-11-07 01:09:08,319 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-11-07 01:09:08,319 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 291) no Hoare annotation was computed. [2021-11-07 01:09:08,319 INFO L857 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2021-11-07 01:09:08,320 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-11-07 01:09:08,320 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-11-07 01:09:08,320 INFO L857 garLoopResultBuilder]: For program point L1452(lines 1452 1455) no Hoare annotation was computed. [2021-11-07 01:09:08,320 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,320 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 593) no Hoare annotation was computed. [2021-11-07 01:09:08,320 INFO L857 garLoopResultBuilder]: For program point L528-1(lines 528 593) no Hoare annotation was computed. [2021-11-07 01:09:08,321 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-11-07 01:09:08,321 INFO L857 garLoopResultBuilder]: For program point L530(lines 530 570) no Hoare annotation was computed. [2021-11-07 01:09:08,321 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-11-07 01:09:08,321 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-11-07 01:09:08,322 INFO L860 garLoopResultBuilder]: At program point L796(lines 780 835) the Hoare annotation is: true [2021-11-07 01:09:08,322 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-11-07 01:09:08,322 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 832) no Hoare annotation was computed. [2021-11-07 01:09:08,322 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,322 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,323 INFO L857 garLoopResultBuilder]: For program point L798(lines 798 831) no Hoare annotation was computed. [2021-11-07 01:09:08,323 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,323 INFO L857 garLoopResultBuilder]: For program point L1591-2(lines 1589 1620) no Hoare annotation was computed. [2021-11-07 01:09:08,323 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,323 INFO L857 garLoopResultBuilder]: For program point L799(lines 799 809) no Hoare annotation was computed. [2021-11-07 01:09:08,323 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 277) no Hoare annotation was computed. [2021-11-07 01:09:08,324 INFO L857 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-11-07 01:09:08,324 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-11-07 01:09:08,324 INFO L857 garLoopResultBuilder]: For program point L1462(lines 1462 1482) no Hoare annotation was computed. [2021-11-07 01:09:08,324 INFO L857 garLoopResultBuilder]: For program point L1330(lines 1330 1546) no Hoare annotation was computed. [2021-11-07 01:09:08,324 INFO L857 garLoopResultBuilder]: For program point L1066(lines 1066 1085) no Hoare annotation was computed. [2021-11-07 01:09:08,324 INFO L857 garLoopResultBuilder]: For program point L1066-1(lines 1066 1085) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1066-2(lines 1066 1085) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1066-3(lines 1066 1085) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1463(lines 1463 1466) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1067(lines 1067 1072) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1067-2(lines 1067 1072) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1067-4(lines 1067 1072) no Hoare annotation was computed. [2021-11-07 01:09:08,325 INFO L857 garLoopResultBuilder]: For program point L1067-6(lines 1067 1072) no Hoare annotation was computed. [2021-11-07 01:09:08,326 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,326 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 146) no Hoare annotation was computed. [2021-11-07 01:09:08,326 INFO L857 garLoopResultBuilder]: For program point L144-1(lines 144 146) no Hoare annotation was computed. [2021-11-07 01:09:08,326 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,326 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-11-07 01:09:08,327 INFO L857 garLoopResultBuilder]: For program point L1468(lines 1468 1481) no Hoare annotation was computed. [2021-11-07 01:09:08,327 INFO L853 garLoopResultBuilder]: At program point L1074(lines 1066 1085) the Hoare annotation is: false [2021-11-07 01:09:08,327 INFO L853 garLoopResultBuilder]: At program point L1074-1(lines 1066 1085) the Hoare annotation is: false [2021-11-07 01:09:08,327 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-11-07 01:09:08,327 INFO L853 garLoopResultBuilder]: At program point L1074-3(lines 1066 1085) the Hoare annotation is: false [2021-11-07 01:09:08,327 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,328 INFO L857 garLoopResultBuilder]: For program point L1339(lines 1339 1544) no Hoare annotation was computed. [2021-11-07 01:09:08,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,328 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-11-07 01:09:08,328 INFO L857 garLoopResultBuilder]: For program point L1472(lines 1472 1480) no Hoare annotation was computed. [2021-11-07 01:09:08,329 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-11-07 01:09:08,329 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-11-07 01:09:08,329 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-11-07 01:09:08,329 INFO L857 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2021-11-07 01:09:08,330 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-11-07 01:09:08,330 INFO L857 garLoopResultBuilder]: For program point L1079-2(lines 1079 1083) no Hoare annotation was computed. [2021-11-07 01:09:08,330 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-11-07 01:09:08,330 INFO L857 garLoopResultBuilder]: For program point L1079-4(lines 1079 1083) no Hoare annotation was computed. [2021-11-07 01:09:08,330 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-11-07 01:09:08,331 INFO L857 garLoopResultBuilder]: For program point L1079-6(lines 1079 1083) no Hoare annotation was computed. [2021-11-07 01:09:08,331 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-11-07 01:09:08,331 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-11-07 01:09:08,331 INFO L857 garLoopResultBuilder]: For program point L1476(lines 1476 1479) no Hoare annotation was computed. [2021-11-07 01:09:08,332 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,332 INFO L857 garLoopResultBuilder]: For program point L817(lines 817 829) no Hoare annotation was computed. [2021-11-07 01:09:08,332 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,332 INFO L857 garLoopResultBuilder]: For program point L1610(lines 1610 1616) no Hoare annotation was computed. [2021-11-07 01:09:08,332 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-11-07 01:09:08,332 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-11-07 01:09:08,333 INFO L857 garLoopResultBuilder]: For program point L818(lines 818 822) no Hoare annotation was computed. [2021-11-07 01:09:08,333 INFO L857 garLoopResultBuilder]: For program point L1348(lines 1348 1542) no Hoare annotation was computed. [2021-11-07 01:09:08,333 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,333 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,333 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-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point L295-1(lines 229 417) no Hoare annotation was computed. [2021-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2021-11-07 01:09:08,334 INFO L857 garLoopResultBuilder]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-10(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-12(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-14(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-16(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-18(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,335 INFO L857 garLoopResultBuilder]: For program point L956-20(lines 956 962) no Hoare annotation was computed. [2021-11-07 01:09:08,336 INFO L857 garLoopResultBuilder]: For program point L562(lines 562 564) no Hoare annotation was computed. [2021-11-07 01:09:08,336 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-11-07 01:09:08,336 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,336 INFO L857 garLoopResultBuilder]: For program point L1357(lines 1357 1540) no Hoare annotation was computed. [2021-11-07 01:09:08,336 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,337 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 307) no Hoare annotation was computed. [2021-11-07 01:09:08,337 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,337 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-11-07 01:09:08,337 INFO L857 garLoopResultBuilder]: For program point L1362(lines 1362 1538) no Hoare annotation was computed. [2021-11-07 01:09:08,337 INFO L857 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point L1627-2(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point L1627-3(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point L1627-4(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point L1627-5(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,338 INFO L857 garLoopResultBuilder]: For program point L1627-6(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,339 INFO L857 garLoopResultBuilder]: For program point L1627-7(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,339 INFO L857 garLoopResultBuilder]: For program point L1627-8(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,339 INFO L857 garLoopResultBuilder]: For program point L1627-9(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,339 INFO L857 garLoopResultBuilder]: For program point L1627-10(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,339 INFO L857 garLoopResultBuilder]: For program point L1627-11(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,339 INFO L857 garLoopResultBuilder]: For program point L1627-12(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point L1627-13(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point L1627-14(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point L1627-15(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point L1627-16(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point L1627-17(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point L1627-18(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,340 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-19(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-20(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-21(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-22(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-23(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-24(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,341 INFO L857 garLoopResultBuilder]: For program point L1627-25(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,342 INFO L857 garLoopResultBuilder]: For program point L1627-26(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,342 INFO L857 garLoopResultBuilder]: For program point L1627-27(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,342 INFO L857 garLoopResultBuilder]: For program point L1627-28(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,342 INFO L857 garLoopResultBuilder]: For program point L1627-29(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,342 INFO L857 garLoopResultBuilder]: For program point L1627-30(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,342 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-11-07 01:09:08,343 INFO L857 garLoopResultBuilder]: For program point L1627-31(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,343 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-11-07 01:09:08,343 INFO L857 garLoopResultBuilder]: For program point L1627-32(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,343 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-11-07 01:09:08,343 INFO L857 garLoopResultBuilder]: For program point L1627-33(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,343 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-11-07 01:09:08,344 INFO L857 garLoopResultBuilder]: For program point L1627-34(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,344 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-11-07 01:09:08,344 INFO L857 garLoopResultBuilder]: For program point L1627-35(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,344 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-11-07 01:09:08,344 INFO L857 garLoopResultBuilder]: For program point L1627-36(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,344 INFO L857 garLoopResultBuilder]: For program point L1627-37(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,345 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-11-07 01:09:08,345 INFO L857 garLoopResultBuilder]: For program point L1627-38(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,345 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-11-07 01:09:08,345 INFO L857 garLoopResultBuilder]: For program point L1627-39(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,345 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-11-07 01:09:08,346 INFO L857 garLoopResultBuilder]: For program point L1627-40(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,346 INFO L857 garLoopResultBuilder]: For program point L1627-41(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,346 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-11-07 01:09:08,346 INFO L857 garLoopResultBuilder]: For program point L1627-42(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,346 INFO L857 garLoopResultBuilder]: For program point L1627-43(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,346 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-11-07 01:09:08,347 INFO L857 garLoopResultBuilder]: For program point L1627-44(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,347 INFO L857 garLoopResultBuilder]: For program point L1627-45(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,347 INFO L857 garLoopResultBuilder]: For program point L1627-46(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,347 INFO L857 garLoopResultBuilder]: For program point L1627-47(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,347 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-11-07 01:09:08,347 INFO L857 garLoopResultBuilder]: For program point L1627-48(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,348 INFO L857 garLoopResultBuilder]: For program point L1627-49(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,348 INFO L857 garLoopResultBuilder]: For program point L1627-50(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,348 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-11-07 01:09:08,348 INFO L857 garLoopResultBuilder]: For program point L1627-51(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,348 INFO L857 garLoopResultBuilder]: For program point L1627-52(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,349 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-11-07 01:09:08,349 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-11-07 01:09:08,349 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-11-07 01:09:08,349 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-11-07 01:09:08,350 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-11-07 01:09:08,350 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-11-07 01:09:08,350 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-11-07 01:09:08,350 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-11-07 01:09:08,350 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-11-07 01:09:08,351 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-11-07 01:09:08,351 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-11-07 01:09:08,351 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-11-07 01:09:08,351 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-11-07 01:09:08,351 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-11-07 01:09:08,352 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-11-07 01:09:08,352 INFO L860 garLoopResultBuilder]: At program point L837(lines 667 839) the Hoare annotation is: true [2021-11-07 01:09:08,352 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-11-07 01:09:08,352 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,353 INFO L857 garLoopResultBuilder]: For program point L1369(lines 1369 1536) no Hoare annotation was computed. [2021-11-07 01:09:08,353 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,353 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-11-07 01:09:08,353 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-11-07 01:09:08,353 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-11-07 01:09:08,354 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-11-07 01:09:08,354 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-11-07 01:09:08,354 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-11-07 01:09:08,354 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-11-07 01:09:08,355 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-11-07 01:09:08,355 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-11-07 01:09:08,355 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-11-07 01:09:08,355 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-11-07 01:09:08,355 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,356 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-11-07 01:09:08,356 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-11-07 01:09:08,356 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-11-07 01:09:08,356 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-11-07 01:09:08,357 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-11-07 01:09:08,357 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-11-07 01:09:08,357 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-11-07 01:09:08,357 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-11-07 01:09:08,357 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-11-07 01:09:08,358 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-11-07 01:09:08,358 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-11-07 01:09:08,358 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,358 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,358 INFO L857 garLoopResultBuilder]: For program point L1376(lines 1376 1534) no Hoare annotation was computed. [2021-11-07 01:09:08,358 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 331) no Hoare annotation was computed. [2021-11-07 01:09:08,359 INFO L857 garLoopResultBuilder]: For program point L980(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,359 INFO L857 garLoopResultBuilder]: For program point L980-2(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,359 INFO L857 garLoopResultBuilder]: For program point L980-4(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,359 INFO L857 garLoopResultBuilder]: For program point L980-6(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,359 INFO L857 garLoopResultBuilder]: For program point L980-8(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,359 INFO L857 garLoopResultBuilder]: For program point L980-10(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point L980-12(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point L980-14(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point L980-16(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point L980-18(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point L980-20(lines 980 984) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:09:08,360 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 330) no Hoare annotation was computed. [2021-11-07 01:09:08,361 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-11-07 01:09:08,361 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,361 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,361 INFO L857 garLoopResultBuilder]: For program point L1383(lines 1383 1532) no Hoare annotation was computed. [2021-11-07 01:09:08,361 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,361 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-11-07 01:09:08,362 INFO L857 garLoopResultBuilder]: For program point L198(lines 198 206) no Hoare annotation was computed. [2021-11-07 01:09:08,362 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,362 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-11-07 01:09:08,362 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-11-07 01:09:08,362 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,363 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,363 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,363 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-11-07 01:09:08,363 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-11-07 01:09:08,363 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,364 INFO L857 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2021-11-07 01:09:08,364 INFO L857 garLoopResultBuilder]: For program point L340-2(lines 340 345) no Hoare annotation was computed. [2021-11-07 01:09:08,364 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,364 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 425) no Hoare annotation was computed. [2021-11-07 01:09:08,364 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-11-07 01:09:08,364 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-11-07 01:09:08,365 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 424) no Hoare annotation was computed. [2021-11-07 01:09:08,365 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-11-07 01:09:08,365 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 423) no Hoare annotation was computed. [2021-11-07 01:09:08,365 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-11-07 01:09:08,365 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-11-07 01:09:08,366 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-11-07 01:09:08,366 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-11-07 01:09:08,366 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-11-07 01:09:08,366 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-11-07 01:09:08,366 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-11-07 01:09:08,367 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-11-07 01:09:08,367 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-11-07 01:09:08,367 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-11-07 01:09:08,367 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-11-07 01:09:08,367 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-11-07 01:09:08,368 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,368 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-11-07 01:09:08,368 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,368 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 01:09:08,368 INFO L857 garLoopResultBuilder]: For program point L1275(lines 1275 1287) no Hoare annotation was computed. [2021-11-07 01:09:08,369 INFO L857 garLoopResultBuilder]: For program point L1275-2(lines 1274 1563) no Hoare annotation was computed. [2021-11-07 01:09:08,369 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,369 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 422) no Hoare annotation was computed. [2021-11-07 01:09:08,369 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,369 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-11-07 01:09:08,369 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,370 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-11-07 01:09:08,370 INFO L857 garLoopResultBuilder]: For program point L1280(lines 1280 1285) no Hoare annotation was computed. [2021-11-07 01:09:08,370 INFO L857 garLoopResultBuilder]: For program point L1017(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,370 INFO L857 garLoopResultBuilder]: For program point L1017-1(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,370 INFO L857 garLoopResultBuilder]: For program point L1017-2(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,370 INFO L857 garLoopResultBuilder]: For program point L1017-3(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,370 INFO L857 garLoopResultBuilder]: For program point L1017-4(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,371 INFO L857 garLoopResultBuilder]: For program point L1017-5(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,371 INFO L857 garLoopResultBuilder]: For program point L1017-6(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,371 INFO L857 garLoopResultBuilder]: For program point L1017-7(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,371 INFO L857 garLoopResultBuilder]: For program point L1017-8(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,371 INFO L857 garLoopResultBuilder]: For program point L1017-9(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,371 INFO L857 garLoopResultBuilder]: For program point L1017-10(lines 1017 1034) no Hoare annotation was computed. [2021-11-07 01:09:08,372 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-11-07 01:09:08,372 INFO L857 garLoopResultBuilder]: For program point L491(lines 491 503) no Hoare annotation was computed. [2021-11-07 01:09:08,372 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 366) no Hoare annotation was computed. [2021-11-07 01:09:08,372 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-11-07 01:09:08,372 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,372 INFO L857 garLoopResultBuilder]: For program point L627(lines 627 629) no Hoare annotation was computed. [2021-11-07 01:09:08,373 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,373 INFO L857 garLoopResultBuilder]: For program point L496(lines 496 502) no Hoare annotation was computed. [2021-11-07 01:09:08,373 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-11-07 01:09:08,373 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,373 INFO L857 garLoopResultBuilder]: For program point L1554(lines 1554 1560) no Hoare annotation was computed. [2021-11-07 01:09:08,373 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-11-07 01:09:08,374 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-11-07 01:09:08,374 INFO L857 garLoopResultBuilder]: For program point L1026(lines 1026 1033) no Hoare annotation was computed. [2021-11-07 01:09:08,377 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:09:08,379 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:09:08,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:09:08 BoogieIcfgContainer [2021-11-07 01:09:08,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:09:08,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:09:08,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:09:08,471 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:09:08,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:08:45" (3/4) ... [2021-11-07 01:09:08,475 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:09:08,520 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 278 nodes and edges [2021-11-07 01:09:08,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 89 nodes and edges [2021-11-07 01:09:08,531 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-07 01:09:08,536 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-07 01:09:08,566 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-11-07 01:09:08,567 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-11-07 01:09:08,567 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-11-07 01:09:08,567 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-11-07 01:09:08,572 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-11-07 01:09:08,576 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-11-07 01:09:08,581 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-11-07 01:09:08,581 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-11-07 01:09:08,583 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-11-07 01:09:08,585 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-11-07 01:09:08,585 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-11-07 01:09:08,585 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-11-07 01:09:08,585 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-11-07 01:09:08,586 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-11-07 01:09:08,779 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:09:08,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:09:08,781 INFO L168 Benchmark]: Toolchain (without parser) took 27718.83 ms. Allocated memory was 109.1 MB in the beginning and 446.7 MB in the end (delta: 337.6 MB). Free memory was 76.8 MB in the beginning and 302.5 MB in the end (delta: -225.8 MB). Peak memory consumption was 112.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,781 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 109.1 MB. Free memory is still 63.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:09:08,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.50 ms. Allocated memory is still 109.1 MB. Free memory was 76.5 MB in the beginning and 70.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.17 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 60.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,783 INFO L168 Benchmark]: Boogie Preprocessor took 200.22 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 60.1 MB in the beginning and 101.4 MB in the end (delta: -41.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,783 INFO L168 Benchmark]: RCFGBuilder took 3002.67 ms. Allocated memory was 132.1 MB in the beginning and 209.7 MB in the end (delta: 77.6 MB). Free memory was 101.3 MB in the beginning and 122.6 MB in the end (delta: -21.3 MB). Peak memory consumption was 68.9 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,784 INFO L168 Benchmark]: TraceAbstraction took 23396.98 ms. Allocated memory was 209.7 MB in the beginning and 446.7 MB in the end (delta: 237.0 MB). Free memory was 122.6 MB in the beginning and 351.8 MB in the end (delta: -229.2 MB). Peak memory consumption was 221.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,784 INFO L168 Benchmark]: Witness Printer took 308.62 ms. Allocated memory is still 446.7 MB. Free memory was 351.8 MB in the beginning and 302.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:09:08,786 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.27 ms. Allocated memory is still 109.1 MB. Free memory is still 63.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 667.50 ms. Allocated memory is still 109.1 MB. Free memory was 76.5 MB in the beginning and 70.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 131.17 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 60.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 200.22 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 60.1 MB in the beginning and 101.4 MB in the end (delta: -41.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3002.67 ms. Allocated memory was 132.1 MB in the beginning and 209.7 MB in the end (delta: 77.6 MB). Free memory was 101.3 MB in the beginning and 122.6 MB in the end (delta: -21.3 MB). Peak memory consumption was 68.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23396.98 ms. Allocated memory was 209.7 MB in the beginning and 446.7 MB in the end (delta: 237.0 MB). Free memory was 122.6 MB in the beginning and 351.8 MB in the end (delta: -229.2 MB). Peak memory consumption was 221.7 MB. Max. memory is 16.1 GB. * Witness Printer took 308.62 ms. Allocated memory is still 446.7 MB. Free memory was 351.8 MB in the beginning and 302.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 23.2s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11730 SDtfs, 7663 SDslu, 14234 SDs, 0 SdLazy, 3717 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 48 MinimizatonAttempts, 658 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 348 NumberOfFragments, 8598 HoareAnnotationTreeSize, 114 FomulaSimplifications, 2854397 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 114 FomulaSimplificationsInter, 515337 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s 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-11-07 01:09:08,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5a89c0f-53bb-4987-bf39-0d15adbb198b/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE