./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/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_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:56:38,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:56:38,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:56:38,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:56:38,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:56:38,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:56:38,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:56:38,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:56:38,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:56:38,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:56:38,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:56:38,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:56:38,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:56:38,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:56:38,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:56:38,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:56:38,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:56:38,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:56:38,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:56:38,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:56:38,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:56:38,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:56:38,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:56:38,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:56:38,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:56:38,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:56:38,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:56:38,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:56:38,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:56:38,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:56:38,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:56:38,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:56:38,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:56:38,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:56:38,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:56:38,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:56:38,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:56:38,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:56:38,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:56:38,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:56:38,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:56:38,729 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:56:38,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:56:38,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:56:38,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:56:38,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:56:38,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:56:38,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:56:38,772 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:56:38,772 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:56:38,772 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:56:38,772 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:56:38,773 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:56:38,773 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:56:38,774 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:56:38,774 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:56:38,774 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:56:38,774 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:56:38,774 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:56:38,775 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:56:38,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:56:38,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:56:38,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:56:38,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:56:38,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:56:38,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:56:38,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:56:38,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:56:38,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:56:38,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:56:38,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:56:38,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:56:38,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:56:38,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:56:38,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:56:38,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:56:38,779 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:56:38,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:56:38,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:56:38,779 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:56:38,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:56:38,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:56:38,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:56:38,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/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_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI 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 [2022-11-03 01:56:39,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:56:39,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:56:39,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:56:39,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:56:39,126 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:56:39,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-11-03 01:56:39,216 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/data/8fae2892c/f94a2e177ac34fc1bc952269b1b0acc6/FLAGe5c1556bf [2022-11-03 01:56:39,763 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:56:39,764 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-11-03 01:56:39,778 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/data/8fae2892c/f94a2e177ac34fc1bc952269b1b0acc6/FLAGe5c1556bf [2022-11-03 01:56:40,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/data/8fae2892c/f94a2e177ac34fc1bc952269b1b0acc6 [2022-11-03 01:56:40,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:56:40,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:56:40,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:56:40,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:56:40,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:56:40,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258cbc7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40, skipping insertion in model container [2022-11-03 01:56:40,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:56:40,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:56:40,554 WARN L230 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_b08fc0bc-2785-4975-b149-a0272de5b7ee/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-11-03 01:56:40,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:56:40,577 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:56:40,685 WARN L230 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_b08fc0bc-2785-4975-b149-a0272de5b7ee/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-11-03 01:56:40,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:56:40,708 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:56:40,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40 WrapperNode [2022-11-03 01:56:40,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:56:40,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:56:40,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:56:40,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:56:40,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,815 INFO L138 Inliner]: procedures = 41, calls = 76, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 1331 [2022-11-03 01:56:40,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:56:40,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:56:40,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:56:40,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:56:40,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,913 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:56:40,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:56:40,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:56:40,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:56:40,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (1/1) ... [2022-11-03 01:56:40,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:56:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:40,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:56:41,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:56:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:56:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-11-03 01:56:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-11-03 01:56:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-11-03 01:56:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-11-03 01:56:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-03 01:56:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-03 01:56:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-03 01:56:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-03 01:56:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 01:56:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 01:56:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:56:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 01:56:41,066 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 01:56:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-11-03 01:56:41,066 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-11-03 01:56:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:56:41,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:56:41,300 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:56:41,302 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:56:41,310 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,393 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-03 01:56:41,393 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-03 01:56:41,394 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,407 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-03 01:56:41,407 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-03 01:56:41,422 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,433 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,447 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,454 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,459 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,462 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:41,472 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:42,240 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume !false; [2022-11-03 01:56:42,240 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2022-11-03 01:56:42,240 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2022-11-03 01:56:42,240 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume !false; [2022-11-03 01:56:42,240 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume false; [2022-11-03 01:56:42,240 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##127: assume !false; [2022-11-03 01:56:42,241 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-11-03 01:56:42,241 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-11-03 01:56:42,241 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-11-03 01:56:42,241 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-11-03 01:56:42,241 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume false; [2022-11-03 01:56:42,242 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##236: assume !false; [2022-11-03 01:56:42,242 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##235: assume false; [2022-11-03 01:56:42,242 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##126: assume false; [2022-11-03 01:56:42,256 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:42,300 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-03 01:56:42,300 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-03 01:56:42,305 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:42,305 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:42,306 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:56:42,350 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-11-03 01:56:42,350 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-11-03 01:56:42,351 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-11-03 01:56:42,351 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-11-03 01:56:42,351 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-11-03 01:56:42,351 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-11-03 01:56:42,368 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:56:42,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:56:42,606 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:56:42,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:42 BoogieIcfgContainer [2022-11-03 01:56:42,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:56:42,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:56:42,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:56:42,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:56:42,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:56:40" (1/3) ... [2022-11-03 01:56:42,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120ba641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:56:42, skipping insertion in model container [2022-11-03 01:56:42,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:40" (2/3) ... [2022-11-03 01:56:42,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120ba641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:56:42, skipping insertion in model container [2022-11-03 01:56:42,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:42" (3/3) ... [2022-11-03 01:56:42,621 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2022-11-03 01:56:42,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:56:42,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:56:42,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:56:42,716 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39300318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:56:42,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:56:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 166 states have (on average 1.5783132530120483) internal successors, (262), 191 states have internal predecessors, (262), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-03 01:56:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:56:42,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:42,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:42,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1042593484, now seen corresponding path program 1 times [2022-11-03 01:56:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:42,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879063727] [2022-11-03 01:56:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:43,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879063727] [2022-11-03 01:56:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879063727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:43,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:43,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:43,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538550487] [2022-11-03 01:56:43,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:43,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:43,109 INFO L87 Difference]: Start difference. First operand has 225 states, 166 states have (on average 1.5783132530120483) internal successors, (262), 191 states have internal predecessors, (262), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:43,540 INFO L93 Difference]: Finished difference Result 432 states and 699 transitions. [2022-11-03 01:56:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:56:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:43,567 INFO L225 Difference]: With dead ends: 432 [2022-11-03 01:56:43,568 INFO L226 Difference]: Without dead ends: 273 [2022-11-03 01:56:43,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:43,584 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 209 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:43,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 433 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-03 01:56:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 256. [2022-11-03 01:56:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 203 states have (on average 1.438423645320197) internal successors, (292), 213 states have internal predecessors, (292), 44 states have call successors, (44), 11 states have call predecessors, (44), 8 states have return successors, (36), 32 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-03 01:56:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 372 transitions. [2022-11-03 01:56:43,697 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 372 transitions. Word has length 11 [2022-11-03 01:56:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:43,698 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 372 transitions. [2022-11-03 01:56:43,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 372 transitions. [2022-11-03 01:56:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:56:43,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:43,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:43,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:56:43,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash -80086493, now seen corresponding path program 1 times [2022-11-03 01:56:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:43,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881578824] [2022-11-03 01:56:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:43,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:43,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881578824] [2022-11-03 01:56:43,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881578824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:43,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:43,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:56:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342441351] [2022-11-03 01:56:43,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:43,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:43,800 INFO L87 Difference]: Start difference. First operand 256 states and 372 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:43,952 INFO L93 Difference]: Finished difference Result 274 states and 395 transitions. [2022-11-03 01:56:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:43,953 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:56:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:43,955 INFO L225 Difference]: With dead ends: 274 [2022-11-03 01:56:43,955 INFO L226 Difference]: Without dead ends: 256 [2022-11-03 01:56:43,956 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:43,957 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 167 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:43,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 364 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-03 01:56:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-03 01:56:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 203 states have (on average 1.4334975369458127) internal successors, (291), 213 states have internal predecessors, (291), 44 states have call successors, (44), 11 states have call predecessors, (44), 8 states have return successors, (36), 32 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-03 01:56:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 371 transitions. [2022-11-03 01:56:43,978 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 371 transitions. Word has length 11 [2022-11-03 01:56:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:43,979 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 371 transitions. [2022-11-03 01:56:43,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 371 transitions. [2022-11-03 01:56:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:56:43,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:43,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:43,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:56:43,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash -593465885, now seen corresponding path program 1 times [2022-11-03 01:56:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:43,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624232114] [2022-11-03 01:56:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:44,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:44,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624232114] [2022-11-03 01:56:44,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624232114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:44,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:44,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720203210] [2022-11-03 01:56:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:44,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:44,117 INFO L87 Difference]: Start difference. First operand 256 states and 371 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:44,244 INFO L93 Difference]: Finished difference Result 336 states and 474 transitions. [2022-11-03 01:56:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:44,246 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 01:56:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:44,250 INFO L225 Difference]: With dead ends: 336 [2022-11-03 01:56:44,251 INFO L226 Difference]: Without dead ends: 317 [2022-11-03 01:56:44,252 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:44,260 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 286 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:44,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 358 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-03 01:56:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2022-11-03 01:56:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 238 states have (on average 1.411764705882353) internal successors, (336), 247 states have internal predecessors, (336), 46 states have call successors, (46), 14 states have call predecessors, (46), 12 states have return successors, (42), 38 states have call predecessors, (42), 37 states have call successors, (42) [2022-11-03 01:56:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2022-11-03 01:56:44,305 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 12 [2022-11-03 01:56:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:44,318 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2022-11-03 01:56:44,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2022-11-03 01:56:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 01:56:44,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:44,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:44,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:56:44,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash -284736438, now seen corresponding path program 1 times [2022-11-03 01:56:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:44,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832108238] [2022-11-03 01:56:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:44,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:44,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832108238] [2022-11-03 01:56:44,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832108238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:44,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:44,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053250518] [2022-11-03 01:56:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:44,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:44,432 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:44,561 INFO L93 Difference]: Finished difference Result 525 states and 742 transitions. [2022-11-03 01:56:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:44,562 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 01:56:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:44,564 INFO L225 Difference]: With dead ends: 525 [2022-11-03 01:56:44,565 INFO L226 Difference]: Without dead ends: 402 [2022-11-03 01:56:44,565 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:44,566 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 277 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:44,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 367 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-03 01:56:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 380. [2022-11-03 01:56:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 306 states have (on average 1.392156862745098) internal successors, (426), 312 states have internal predecessors, (426), 55 states have call successors, (55), 21 states have call predecessors, (55), 18 states have return successors, (60), 49 states have call predecessors, (60), 48 states have call successors, (60) [2022-11-03 01:56:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 541 transitions. [2022-11-03 01:56:44,598 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 541 transitions. Word has length 13 [2022-11-03 01:56:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:44,599 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 541 transitions. [2022-11-03 01:56:44,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 541 transitions. [2022-11-03 01:56:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:56:44,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:44,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:44,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:56:44,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1712234874, now seen corresponding path program 1 times [2022-11-03 01:56:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:44,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765474902] [2022-11-03 01:56:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:44,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765474902] [2022-11-03 01:56:44,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765474902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:44,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:44,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419000947] [2022-11-03 01:56:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:44,771 INFO L87 Difference]: Start difference. First operand 380 states and 541 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:45,065 INFO L93 Difference]: Finished difference Result 389 states and 552 transitions. [2022-11-03 01:56:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:56:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:45,068 INFO L225 Difference]: With dead ends: 389 [2022-11-03 01:56:45,069 INFO L226 Difference]: Without dead ends: 386 [2022-11-03 01:56:45,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:45,070 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 287 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:45,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 396 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-03 01:56:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-03 01:56:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 312 states have (on average 1.3878205128205128) internal successors, (433), 317 states have internal predecessors, (433), 55 states have call successors, (55), 22 states have call predecessors, (55), 18 states have return successors, (60), 49 states have call predecessors, (60), 48 states have call successors, (60) [2022-11-03 01:56:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 548 transitions. [2022-11-03 01:56:45,105 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 548 transitions. Word has length 20 [2022-11-03 01:56:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:45,106 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 548 transitions. [2022-11-03 01:56:45,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 548 transitions. [2022-11-03 01:56:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:56:45,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:45,108 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:45,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:56:45,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 890332800, now seen corresponding path program 1 times [2022-11-03 01:56:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:45,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511522548] [2022-11-03 01:56:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:45,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:45,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511522548] [2022-11-03 01:56:45,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511522548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:45,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:45,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952268684] [2022-11-03 01:56:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:45,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:45,145 INFO L87 Difference]: Start difference. First operand 386 states and 548 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:45,296 INFO L93 Difference]: Finished difference Result 412 states and 578 transitions. [2022-11-03 01:56:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:45,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-03 01:56:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:45,299 INFO L225 Difference]: With dead ends: 412 [2022-11-03 01:56:45,300 INFO L226 Difference]: Without dead ends: 407 [2022-11-03 01:56:45,300 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:45,301 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 28 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:45,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 480 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-03 01:56:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2022-11-03 01:56:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 331 states have (on average 1.3776435045317221) internal successors, (456), 334 states have internal predecessors, (456), 55 states have call successors, (55), 22 states have call predecessors, (55), 18 states have return successors, (60), 49 states have call predecessors, (60), 48 states have call successors, (60) [2022-11-03 01:56:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 571 transitions. [2022-11-03 01:56:45,358 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 571 transitions. Word has length 23 [2022-11-03 01:56:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:45,359 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 571 transitions. [2022-11-03 01:56:45,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 571 transitions. [2022-11-03 01:56:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:56:45,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:45,361 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:45,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:56:45,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 311363535, now seen corresponding path program 1 times [2022-11-03 01:56:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:45,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240412798] [2022-11-03 01:56:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:45,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:45,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240412798] [2022-11-03 01:56:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240412798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:45,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:45,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492660593] [2022-11-03 01:56:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:45,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:45,442 INFO L87 Difference]: Start difference. First operand 405 states and 571 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:45,601 INFO L93 Difference]: Finished difference Result 418 states and 585 transitions. [2022-11-03 01:56:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-03 01:56:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:45,604 INFO L225 Difference]: With dead ends: 418 [2022-11-03 01:56:45,604 INFO L226 Difference]: Without dead ends: 403 [2022-11-03 01:56:45,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:45,605 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 168 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:45,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 899 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-03 01:56:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2022-11-03 01:56:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 330 states have (on average 1.3757575757575757) internal successors, (454), 333 states have internal predecessors, (454), 54 states have call successors, (54), 22 states have call predecessors, (54), 18 states have return successors, (59), 48 states have call predecessors, (59), 47 states have call successors, (59) [2022-11-03 01:56:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 567 transitions. [2022-11-03 01:56:45,646 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 567 transitions. Word has length 25 [2022-11-03 01:56:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:45,647 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 567 transitions. [2022-11-03 01:56:45,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 567 transitions. [2022-11-03 01:56:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:56:45,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:45,648 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:45,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:56:45,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2012364722, now seen corresponding path program 1 times [2022-11-03 01:56:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451146669] [2022-11-03 01:56:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:45,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:45,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451146669] [2022-11-03 01:56:45,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451146669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:45,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:45,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321262964] [2022-11-03 01:56:45,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:45,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:45,723 INFO L87 Difference]: Start difference. First operand 403 states and 567 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:45,882 INFO L93 Difference]: Finished difference Result 416 states and 581 transitions. [2022-11-03 01:56:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-03 01:56:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:45,885 INFO L225 Difference]: With dead ends: 416 [2022-11-03 01:56:45,885 INFO L226 Difference]: Without dead ends: 397 [2022-11-03 01:56:45,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:45,887 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 167 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:45,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 887 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-03 01:56:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-11-03 01:56:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 327 states have (on average 1.3761467889908257) internal successors, (450), 330 states have internal predecessors, (450), 52 states have call successors, (52), 21 states have call predecessors, (52), 17 states have return successors, (57), 46 states have call predecessors, (57), 45 states have call successors, (57) [2022-11-03 01:56:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2022-11-03 01:56:45,926 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 24 [2022-11-03 01:56:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:45,927 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2022-11-03 01:56:45,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2022-11-03 01:56:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:56:45,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:45,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:45,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:56:45,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -494045466, now seen corresponding path program 1 times [2022-11-03 01:56:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:45,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278952399] [2022-11-03 01:56:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:45,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:45,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278952399] [2022-11-03 01:56:45,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278952399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:45,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:45,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059916173] [2022-11-03 01:56:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:45,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:45,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:45,978 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:46,100 INFO L93 Difference]: Finished difference Result 438 states and 611 transitions. [2022-11-03 01:56:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:46,101 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 01:56:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:46,104 INFO L225 Difference]: With dead ends: 438 [2022-11-03 01:56:46,104 INFO L226 Difference]: Without dead ends: 383 [2022-11-03 01:56:46,104 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:46,105 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 63 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:46,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 542 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-03 01:56:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2022-11-03 01:56:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 312 states have (on average 1.3717948717948718) internal successors, (428), 316 states have internal predecessors, (428), 50 states have call successors, (50), 20 states have call predecessors, (50), 16 states have return successors, (54), 43 states have call predecessors, (54), 43 states have call successors, (54) [2022-11-03 01:56:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 532 transitions. [2022-11-03 01:56:46,134 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 532 transitions. Word has length 22 [2022-11-03 01:56:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:46,135 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 532 transitions. [2022-11-03 01:56:46,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 532 transitions. [2022-11-03 01:56:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:56:46,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:46,137 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:46,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:56:46,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:46,138 INFO L85 PathProgramCache]: Analyzing trace with hash 819967605, now seen corresponding path program 1 times [2022-11-03 01:56:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:46,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698772870] [2022-11-03 01:56:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:46,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:46,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698772870] [2022-11-03 01:56:46,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698772870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:46,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:46,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077228509] [2022-11-03 01:56:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:46,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:46,187 INFO L87 Difference]: Start difference. First operand 379 states and 532 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:46,333 INFO L93 Difference]: Finished difference Result 559 states and 784 transitions. [2022-11-03 01:56:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:46,337 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:56:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:46,340 INFO L225 Difference]: With dead ends: 559 [2022-11-03 01:56:46,341 INFO L226 Difference]: Without dead ends: 382 [2022-11-03 01:56:46,342 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:46,344 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:46,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-03 01:56:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-11-03 01:56:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 315 states have (on average 1.3714285714285714) internal successors, (432), 319 states have internal predecessors, (432), 50 states have call successors, (50), 20 states have call predecessors, (50), 16 states have return successors, (54), 43 states have call predecessors, (54), 43 states have call successors, (54) [2022-11-03 01:56:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 536 transitions. [2022-11-03 01:56:46,384 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 536 transitions. Word has length 24 [2022-11-03 01:56:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:46,385 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 536 transitions. [2022-11-03 01:56:46,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 536 transitions. [2022-11-03 01:56:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:56:46,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:46,386 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:46,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:56:46,387 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1419607011, now seen corresponding path program 1 times [2022-11-03 01:56:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:46,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204113274] [2022-11-03 01:56:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:46,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:46,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:46,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204113274] [2022-11-03 01:56:46,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204113274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:46,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:46,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486785952] [2022-11-03 01:56:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:46,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:46,475 INFO L87 Difference]: Start difference. First operand 382 states and 536 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:46,616 INFO L93 Difference]: Finished difference Result 418 states and 579 transitions. [2022-11-03 01:56:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:46,616 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 01:56:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:46,619 INFO L225 Difference]: With dead ends: 418 [2022-11-03 01:56:46,619 INFO L226 Difference]: Without dead ends: 398 [2022-11-03 01:56:46,619 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:46,620 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 31 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:46,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 747 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-03 01:56:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2022-11-03 01:56:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 317 states have (on average 1.3690851735015772) internal successors, (434), 321 states have internal predecessors, (434), 50 states have call successors, (50), 20 states have call predecessors, (50), 16 states have return successors, (54), 43 states have call predecessors, (54), 43 states have call successors, (54) [2022-11-03 01:56:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 538 transitions. [2022-11-03 01:56:46,651 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 538 transitions. Word has length 23 [2022-11-03 01:56:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:46,651 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 538 transitions. [2022-11-03 01:56:46,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 538 transitions. [2022-11-03 01:56:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:56:46,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:46,653 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:46,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:56:46,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 621880155, now seen corresponding path program 1 times [2022-11-03 01:56:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:46,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783373598] [2022-11-03 01:56:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:46,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:46,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783373598] [2022-11-03 01:56:46,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783373598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:46,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:46,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939323638] [2022-11-03 01:56:46,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:46,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:46,713 INFO L87 Difference]: Start difference. First operand 384 states and 538 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:46,884 INFO L93 Difference]: Finished difference Result 473 states and 667 transitions. [2022-11-03 01:56:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:46,885 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-11-03 01:56:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:46,888 INFO L225 Difference]: With dead ends: 473 [2022-11-03 01:56:46,888 INFO L226 Difference]: Without dead ends: 470 [2022-11-03 01:56:46,888 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:46,889 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 63 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:46,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 505 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-03 01:56:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 410. [2022-11-03 01:56:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 340 states have (on average 1.3794117647058823) internal successors, (469), 346 states have internal predecessors, (469), 51 states have call successors, (51), 21 states have call predecessors, (51), 18 states have return successors, (56), 43 states have call predecessors, (56), 44 states have call successors, (56) [2022-11-03 01:56:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 576 transitions. [2022-11-03 01:56:46,933 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 576 transitions. Word has length 26 [2022-11-03 01:56:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:46,935 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 576 transitions. [2022-11-03 01:56:46,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 576 transitions. [2022-11-03 01:56:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:56:46,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:46,937 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:46,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:56:46,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1191476330, now seen corresponding path program 1 times [2022-11-03 01:56:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:46,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780841626] [2022-11-03 01:56:46,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:46,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780841626] [2022-11-03 01:56:46,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780841626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:46,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:46,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298989269] [2022-11-03 01:56:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:46,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:46,995 INFO L87 Difference]: Start difference. First operand 410 states and 576 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:47,134 INFO L93 Difference]: Finished difference Result 424 states and 591 transitions. [2022-11-03 01:56:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:47,135 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-03 01:56:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:47,137 INFO L225 Difference]: With dead ends: 424 [2022-11-03 01:56:47,138 INFO L226 Difference]: Without dead ends: 408 [2022-11-03 01:56:47,138 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:47,139 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 16 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 747 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-03 01:56:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2022-11-03 01:56:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 339 states have (on average 1.3775811209439528) internal successors, (467), 345 states have internal predecessors, (467), 50 states have call successors, (50), 21 states have call predecessors, (50), 18 states have return successors, (55), 42 states have call predecessors, (55), 43 states have call successors, (55) [2022-11-03 01:56:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 572 transitions. [2022-11-03 01:56:47,179 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 572 transitions. Word has length 25 [2022-11-03 01:56:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:47,179 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 572 transitions. [2022-11-03 01:56:47,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 572 transitions. [2022-11-03 01:56:47,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:56:47,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:47,181 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:47,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:56:47,182 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1419234592, now seen corresponding path program 1 times [2022-11-03 01:56:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:47,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497932284] [2022-11-03 01:56:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:47,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:47,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497932284] [2022-11-03 01:56:47,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497932284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:47,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:47,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130902453] [2022-11-03 01:56:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:47,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:47,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:47,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:47,235 INFO L87 Difference]: Start difference. First operand 408 states and 572 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:47,370 INFO L93 Difference]: Finished difference Result 422 states and 587 transitions. [2022-11-03 01:56:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:47,371 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-03 01:56:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:47,373 INFO L225 Difference]: With dead ends: 422 [2022-11-03 01:56:47,373 INFO L226 Difference]: Without dead ends: 406 [2022-11-03 01:56:47,374 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:47,375 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 16 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:47,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 722 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-11-03 01:56:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2022-11-03 01:56:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 338 states have (on average 1.3757396449704142) internal successors, (465), 344 states have internal predecessors, (465), 49 states have call successors, (49), 21 states have call predecessors, (49), 18 states have return successors, (54), 41 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-03 01:56:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 568 transitions. [2022-11-03 01:56:47,417 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 568 transitions. Word has length 25 [2022-11-03 01:56:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:47,417 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 568 transitions. [2022-11-03 01:56:47,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 568 transitions. [2022-11-03 01:56:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:56:47,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:47,419 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:47,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:56:47,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1860060461, now seen corresponding path program 1 times [2022-11-03 01:56:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:47,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755233453] [2022-11-03 01:56:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:47,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:47,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755233453] [2022-11-03 01:56:47,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755233453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:47,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:47,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079255083] [2022-11-03 01:56:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:47,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:47,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:47,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:47,541 INFO L87 Difference]: Start difference. First operand 406 states and 568 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:47,857 INFO L93 Difference]: Finished difference Result 489 states and 661 transitions. [2022-11-03 01:56:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-03 01:56:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:47,861 INFO L225 Difference]: With dead ends: 489 [2022-11-03 01:56:47,861 INFO L226 Difference]: Without dead ends: 419 [2022-11-03 01:56:47,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:47,865 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 412 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:47,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 326 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-03 01:56:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 400. [2022-11-03 01:56:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 332 states have (on average 1.358433734939759) internal successors, (451), 338 states have internal predecessors, (451), 49 states have call successors, (49), 21 states have call predecessors, (49), 18 states have return successors, (54), 41 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-03 01:56:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 554 transitions. [2022-11-03 01:56:47,905 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 554 transitions. Word has length 27 [2022-11-03 01:56:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:47,906 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 554 transitions. [2022-11-03 01:56:47,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 554 transitions. [2022-11-03 01:56:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:56:47,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:47,908 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:47,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 01:56:47,908 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2105922413, now seen corresponding path program 1 times [2022-11-03 01:56:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291323698] [2022-11-03 01:56:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:47,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291323698] [2022-11-03 01:56:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291323698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:47,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417724465] [2022-11-03 01:56:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:47,986 INFO L87 Difference]: Start difference. First operand 400 states and 554 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:48,344 INFO L93 Difference]: Finished difference Result 408 states and 560 transitions. [2022-11-03 01:56:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:48,344 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-03 01:56:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:48,347 INFO L225 Difference]: With dead ends: 408 [2022-11-03 01:56:48,347 INFO L226 Difference]: Without dead ends: 402 [2022-11-03 01:56:48,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:48,348 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 308 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:48,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 526 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-03 01:56:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-11-03 01:56:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 332 states have (on average 1.355421686746988) internal successors, (450), 338 states have internal predecessors, (450), 49 states have call successors, (49), 21 states have call predecessors, (49), 18 states have return successors, (54), 41 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-03 01:56:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 553 transitions. [2022-11-03 01:56:48,398 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 553 transitions. Word has length 27 [2022-11-03 01:56:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:48,399 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 553 transitions. [2022-11-03 01:56:48,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 553 transitions. [2022-11-03 01:56:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:56:48,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:48,401 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:48,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:56:48,402 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1215469325, now seen corresponding path program 1 times [2022-11-03 01:56:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:48,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184404844] [2022-11-03 01:56:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:48,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:48,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184404844] [2022-11-03 01:56:48,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184404844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:48,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:48,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342451431] [2022-11-03 01:56:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:48,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:48,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:48,493 INFO L87 Difference]: Start difference. First operand 400 states and 553 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:48,684 INFO L93 Difference]: Finished difference Result 444 states and 593 transitions. [2022-11-03 01:56:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:48,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-03 01:56:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:48,686 INFO L225 Difference]: With dead ends: 444 [2022-11-03 01:56:48,686 INFO L226 Difference]: Without dead ends: 319 [2022-11-03 01:56:48,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:48,688 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 300 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:48,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 474 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-03 01:56:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 302. [2022-11-03 01:56:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 250 states have (on average 1.32) internal successors, (330), 257 states have internal predecessors, (330), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (34), 30 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-03 01:56:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 401 transitions. [2022-11-03 01:56:48,720 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 401 transitions. Word has length 29 [2022-11-03 01:56:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:48,721 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 401 transitions. [2022-11-03 01:56:48,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 401 transitions. [2022-11-03 01:56:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:56:48,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:48,722 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:48,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 01:56:48,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1094290, now seen corresponding path program 1 times [2022-11-03 01:56:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:48,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035513206] [2022-11-03 01:56:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:48,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:48,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035513206] [2022-11-03 01:56:48,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035513206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:48,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:48,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383071119] [2022-11-03 01:56:48,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:48,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:48,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:48,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:48,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:48,848 INFO L87 Difference]: Start difference. First operand 302 states and 401 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:49,188 INFO L93 Difference]: Finished difference Result 310 states and 407 transitions. [2022-11-03 01:56:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:49,189 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-03 01:56:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:49,190 INFO L225 Difference]: With dead ends: 310 [2022-11-03 01:56:49,191 INFO L226 Difference]: Without dead ends: 304 [2022-11-03 01:56:49,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:49,192 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 304 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:49,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 527 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-03 01:56:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2022-11-03 01:56:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 250 states have (on average 1.316) internal successors, (329), 257 states have internal predecessors, (329), 37 states have call successors, (37), 15 states have call predecessors, (37), 14 states have return successors, (34), 30 states have call predecessors, (34), 30 states have call successors, (34) [2022-11-03 01:56:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 400 transitions. [2022-11-03 01:56:49,232 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 400 transitions. Word has length 28 [2022-11-03 01:56:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:49,233 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 400 transitions. [2022-11-03 01:56:49,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 400 transitions. [2022-11-03 01:56:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:56:49,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:49,234 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:49,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 01:56:49,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:49,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash -494061083, now seen corresponding path program 1 times [2022-11-03 01:56:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805456636] [2022-11-03 01:56:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:49,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805456636] [2022-11-03 01:56:49,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805456636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:49,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:49,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87783431] [2022-11-03 01:56:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:49,307 INFO L87 Difference]: Start difference. First operand 302 states and 400 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:49,445 INFO L93 Difference]: Finished difference Result 461 states and 607 transitions. [2022-11-03 01:56:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:49,446 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), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-03 01:56:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:49,448 INFO L225 Difference]: With dead ends: 461 [2022-11-03 01:56:49,448 INFO L226 Difference]: Without dead ends: 349 [2022-11-03 01:56:49,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:49,450 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 88 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:49,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 483 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-03 01:56:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 330. [2022-11-03 01:56:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 273 states have (on average 1.3076923076923077) internal successors, (357), 279 states have internal predecessors, (357), 39 states have call successors, (39), 17 states have call predecessors, (39), 17 states have return successors, (40), 34 states have call predecessors, (40), 33 states have call successors, (40) [2022-11-03 01:56:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 436 transitions. [2022-11-03 01:56:49,497 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 436 transitions. Word has length 30 [2022-11-03 01:56:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:49,497 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 436 transitions. [2022-11-03 01:56:49,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 436 transitions. [2022-11-03 01:56:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:56:49,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:49,500 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:49,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 01:56:49,501 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 50064694, now seen corresponding path program 1 times [2022-11-03 01:56:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:49,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911522344] [2022-11-03 01:56:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:49,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:49,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911522344] [2022-11-03 01:56:49,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911522344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:49,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:49,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701225616] [2022-11-03 01:56:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:49,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:49,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:49,633 INFO L87 Difference]: Start difference. First operand 330 states and 436 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:49,809 INFO L93 Difference]: Finished difference Result 344 states and 449 transitions. [2022-11-03 01:56:49,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:49,810 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-03 01:56:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:49,812 INFO L225 Difference]: With dead ends: 344 [2022-11-03 01:56:49,812 INFO L226 Difference]: Without dead ends: 326 [2022-11-03 01:56:49,813 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:49,813 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 21 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:49,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 940 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-03 01:56:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-11-03 01:56:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 270 states have (on average 1.3074074074074074) internal successors, (353), 276 states have internal predecessors, (353), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (39), 33 states have call predecessors, (39), 32 states have call successors, (39) [2022-11-03 01:56:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 430 transitions. [2022-11-03 01:56:49,853 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 430 transitions. Word has length 29 [2022-11-03 01:56:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:49,853 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 430 transitions. [2022-11-03 01:56:49,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 430 transitions. [2022-11-03 01:56:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:56:49,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:49,855 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:49,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:56:49,855 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:49,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:49,856 INFO L85 PathProgramCache]: Analyzing trace with hash 508469964, now seen corresponding path program 1 times [2022-11-03 01:56:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:49,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109378593] [2022-11-03 01:56:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:49,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:49,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109378593] [2022-11-03 01:56:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109378593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:49,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:49,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683649118] [2022-11-03 01:56:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:49,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:49,961 INFO L87 Difference]: Start difference. First operand 326 states and 430 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:50,385 INFO L93 Difference]: Finished difference Result 386 states and 500 transitions. [2022-11-03 01:56:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:50,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-03 01:56:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:50,387 INFO L225 Difference]: With dead ends: 386 [2022-11-03 01:56:50,388 INFO L226 Difference]: Without dead ends: 335 [2022-11-03 01:56:50,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:56:50,389 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 292 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:50,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 627 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-03 01:56:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 328. [2022-11-03 01:56:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 271 states have (on average 1.2988929889298892) internal successors, (352), 278 states have internal predecessors, (352), 38 states have call successors, (38), 17 states have call predecessors, (38), 18 states have return successors, (40), 33 states have call predecessors, (40), 32 states have call successors, (40) [2022-11-03 01:56:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 430 transitions. [2022-11-03 01:56:50,430 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 430 transitions. Word has length 29 [2022-11-03 01:56:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:50,431 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 430 transitions. [2022-11-03 01:56:50,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 430 transitions. [2022-11-03 01:56:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:56:50,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:50,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:50,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 01:56:50,433 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -961785214, now seen corresponding path program 1 times [2022-11-03 01:56:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:50,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388823235] [2022-11-03 01:56:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:50,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:50,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388823235] [2022-11-03 01:56:50,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388823235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:50,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:50,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942401161] [2022-11-03 01:56:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:50,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:50,606 INFO L87 Difference]: Start difference. First operand 328 states and 430 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:50,726 INFO L93 Difference]: Finished difference Result 467 states and 618 transitions. [2022-11-03 01:56:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-11-03 01:56:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:50,729 INFO L225 Difference]: With dead ends: 467 [2022-11-03 01:56:50,729 INFO L226 Difference]: Without dead ends: 319 [2022-11-03 01:56:50,731 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:50,732 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:50,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 458 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-03 01:56:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-11-03 01:56:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 264 states have (on average 1.2878787878787878) internal successors, (340), 269 states have internal predecessors, (340), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (39), 33 states have call predecessors, (39), 32 states have call successors, (39) [2022-11-03 01:56:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 416 transitions. [2022-11-03 01:56:50,782 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 416 transitions. Word has length 31 [2022-11-03 01:56:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:50,783 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 416 transitions. [2022-11-03 01:56:50,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 416 transitions. [2022-11-03 01:56:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:56:50,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:50,784 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:50,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 01:56:50,785 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1548544903, now seen corresponding path program 1 times [2022-11-03 01:56:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669372] [2022-11-03 01:56:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:50,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:50,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669372] [2022-11-03 01:56:50,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:50,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:50,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785533325] [2022-11-03 01:56:50,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:50,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:50,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:50,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:50,895 INFO L87 Difference]: Start difference. First operand 319 states and 416 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:51,294 INFO L93 Difference]: Finished difference Result 374 states and 482 transitions. [2022-11-03 01:56:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:51,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-03 01:56:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:51,297 INFO L225 Difference]: With dead ends: 374 [2022-11-03 01:56:51,297 INFO L226 Difference]: Without dead ends: 323 [2022-11-03 01:56:51,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:51,301 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 279 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:51,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 633 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-03 01:56:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2022-11-03 01:56:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 264 states have (on average 1.2803030303030303) internal successors, (338), 269 states have internal predecessors, (338), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (39), 33 states have call predecessors, (39), 32 states have call successors, (39) [2022-11-03 01:56:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 414 transitions. [2022-11-03 01:56:51,351 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 414 transitions. Word has length 30 [2022-11-03 01:56:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:51,352 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 414 transitions. [2022-11-03 01:56:51,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 414 transitions. [2022-11-03 01:56:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:56:51,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:51,353 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:51,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 01:56:51,354 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 758415322, now seen corresponding path program 1 times [2022-11-03 01:56:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003808652] [2022-11-03 01:56:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:51,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:51,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003808652] [2022-11-03 01:56:51,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003808652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:51,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:51,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:56:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327549036] [2022-11-03 01:56:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:51,485 INFO L87 Difference]: Start difference. First operand 319 states and 414 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:51,789 INFO L93 Difference]: Finished difference Result 349 states and 447 transitions. [2022-11-03 01:56:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-11-03 01:56:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:51,791 INFO L225 Difference]: With dead ends: 349 [2022-11-03 01:56:51,792 INFO L226 Difference]: Without dead ends: 330 [2022-11-03 01:56:51,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:56:51,793 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 204 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1024 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-03 01:56:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 313. [2022-11-03 01:56:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 259 states have (on average 1.2432432432432432) internal successors, (322), 264 states have internal predecessors, (322), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (38), 32 states have call predecessors, (38), 31 states have call successors, (38) [2022-11-03 01:56:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 396 transitions. [2022-11-03 01:56:51,864 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 396 transitions. Word has length 31 [2022-11-03 01:56:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:51,865 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 396 transitions. [2022-11-03 01:56:51,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 396 transitions. [2022-11-03 01:56:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 01:56:51,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:51,867 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:51,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 01:56:51,868 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1083528569, now seen corresponding path program 1 times [2022-11-03 01:56:51,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:51,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864397098] [2022-11-03 01:56:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:51,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:51,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864397098] [2022-11-03 01:56:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864397098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:51,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590628107] [2022-11-03 01:56:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:51,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:51,910 INFO L87 Difference]: Start difference. First operand 313 states and 396 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:52,073 INFO L93 Difference]: Finished difference Result 340 states and 426 transitions. [2022-11-03 01:56:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-11-03 01:56:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:52,080 INFO L225 Difference]: With dead ends: 340 [2022-11-03 01:56:52,080 INFO L226 Difference]: Without dead ends: 290 [2022-11-03 01:56:52,081 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:52,082 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 36 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:52,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 380 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-03 01:56:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2022-11-03 01:56:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 233 states have (on average 1.257510729613734) internal successors, (293), 238 states have internal predecessors, (293), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2022-11-03 01:56:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 362 transitions. [2022-11-03 01:56:52,133 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 362 transitions. Word has length 31 [2022-11-03 01:56:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:52,134 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 362 transitions. [2022-11-03 01:56:52,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 362 transitions. [2022-11-03 01:56:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 01:56:52,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:52,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:52,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 01:56:52,136 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1701243431, now seen corresponding path program 1 times [2022-11-03 01:56:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:52,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900532055] [2022-11-03 01:56:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:52,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:52,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900532055] [2022-11-03 01:56:52,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900532055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:52,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:52,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219842047] [2022-11-03 01:56:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:52,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:52,262 INFO L87 Difference]: Start difference. First operand 282 states and 362 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:52,526 INFO L93 Difference]: Finished difference Result 423 states and 548 transitions. [2022-11-03 01:56:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:52,527 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-03 01:56:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:52,529 INFO L225 Difference]: With dead ends: 423 [2022-11-03 01:56:52,529 INFO L226 Difference]: Without dead ends: 284 [2022-11-03 01:56:52,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:52,530 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 227 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:52,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 470 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-03 01:56:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2022-11-03 01:56:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 233 states have (on average 1.2532188841201717) internal successors, (292), 238 states have internal predecessors, (292), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2022-11-03 01:56:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 361 transitions. [2022-11-03 01:56:52,586 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 361 transitions. Word has length 33 [2022-11-03 01:56:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:52,586 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 361 transitions. [2022-11-03 01:56:52,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 361 transitions. [2022-11-03 01:56:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 01:56:52,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:52,588 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:52,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 01:56:52,588 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:52,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1222442279, now seen corresponding path program 1 times [2022-11-03 01:56:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:52,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273197782] [2022-11-03 01:56:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:52,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:52,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:52,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273197782] [2022-11-03 01:56:52,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273197782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:52,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:52,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148285118] [2022-11-03 01:56:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:52,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:52,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:52,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:52,650 INFO L87 Difference]: Start difference. First operand 282 states and 361 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:52,911 INFO L93 Difference]: Finished difference Result 292 states and 370 transitions. [2022-11-03 01:56:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:52,911 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-03 01:56:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:52,913 INFO L225 Difference]: With dead ends: 292 [2022-11-03 01:56:52,913 INFO L226 Difference]: Without dead ends: 288 [2022-11-03 01:56:52,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:52,915 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 274 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:52,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 446 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-03 01:56:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-11-03 01:56:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 235 states have (on average 1.251063829787234) internal successors, (294), 240 states have internal predecessors, (294), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 29 states have call predecessors, (35), 29 states have call successors, (35) [2022-11-03 01:56:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 363 transitions. [2022-11-03 01:56:52,961 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 363 transitions. Word has length 32 [2022-11-03 01:56:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:52,961 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 363 transitions. [2022-11-03 01:56:52,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 363 transitions. [2022-11-03 01:56:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 01:56:52,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:52,963 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:52,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 01:56:52,963 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1222719109, now seen corresponding path program 1 times [2022-11-03 01:56:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031899516] [2022-11-03 01:56:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:53,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031899516] [2022-11-03 01:56:53,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031899516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:53,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:53,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923913144] [2022-11-03 01:56:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:53,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:53,139 INFO L87 Difference]: Start difference. First operand 284 states and 363 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:53,416 INFO L93 Difference]: Finished difference Result 296 states and 374 transitions. [2022-11-03 01:56:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-11-03 01:56:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:53,419 INFO L225 Difference]: With dead ends: 296 [2022-11-03 01:56:53,419 INFO L226 Difference]: Without dead ends: 280 [2022-11-03 01:56:53,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:53,420 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 9 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:53,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-03 01:56:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-03 01:56:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 232 states have (on average 1.25) internal successors, (290), 237 states have internal predecessors, (290), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-11-03 01:56:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 357 transitions. [2022-11-03 01:56:53,462 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 357 transitions. Word has length 32 [2022-11-03 01:56:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:53,463 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 357 transitions. [2022-11-03 01:56:53,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 357 transitions. [2022-11-03 01:56:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:56:53,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:53,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:53,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 01:56:53,465 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1884835822, now seen corresponding path program 1 times [2022-11-03 01:56:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:53,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9643966] [2022-11-03 01:56:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:53,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9643966] [2022-11-03 01:56:53,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9643966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:53,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:53,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37723462] [2022-11-03 01:56:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:53,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:53,698 INFO L87 Difference]: Start difference. First operand 280 states and 357 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:54,032 INFO L93 Difference]: Finished difference Result 320 states and 407 transitions. [2022-11-03 01:56:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:56:54,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-11-03 01:56:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:54,035 INFO L225 Difference]: With dead ends: 320 [2022-11-03 01:56:54,035 INFO L226 Difference]: Without dead ends: 316 [2022-11-03 01:56:54,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:54,036 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 298 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:54,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 575 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-03 01:56:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2022-11-03 01:56:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 232 states have (on average 1.25) internal successors, (290), 237 states have internal predecessors, (290), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-11-03 01:56:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 357 transitions. [2022-11-03 01:56:54,077 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 357 transitions. Word has length 34 [2022-11-03 01:56:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:54,078 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 357 transitions. [2022-11-03 01:56:54,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 357 transitions. [2022-11-03 01:56:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 01:56:54,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:54,079 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 01:56:54,080 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1898235853, now seen corresponding path program 1 times [2022-11-03 01:56:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:54,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682233235] [2022-11-03 01:56:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:54,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:54,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682233235] [2022-11-03 01:56:54,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682233235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:54,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:54,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:56:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658496254] [2022-11-03 01:56:54,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:54,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:54,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:54,173 INFO L87 Difference]: Start difference. First operand 280 states and 357 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:54,360 INFO L93 Difference]: Finished difference Result 307 states and 388 transitions. [2022-11-03 01:56:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-03 01:56:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:54,363 INFO L225 Difference]: With dead ends: 307 [2022-11-03 01:56:54,363 INFO L226 Difference]: Without dead ends: 282 [2022-11-03 01:56:54,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:54,364 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:54,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1013 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-03 01:56:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-03 01:56:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 233 states have (on average 1.2489270386266094) internal successors, (291), 239 states have internal predecessors, (291), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (35), 28 states have call predecessors, (35), 28 states have call successors, (35) [2022-11-03 01:56:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 359 transitions. [2022-11-03 01:56:54,407 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 359 transitions. Word has length 33 [2022-11-03 01:56:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:54,407 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 359 transitions. [2022-11-03 01:56:54,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 359 transitions. [2022-11-03 01:56:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 01:56:54,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:54,409 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:54,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 01:56:54,409 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1678661278, now seen corresponding path program 1 times [2022-11-03 01:56:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:54,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578469566] [2022-11-03 01:56:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:54,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:54,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578469566] [2022-11-03 01:56:54,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578469566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:54,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:54,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:54,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785841674] [2022-11-03 01:56:54,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:54,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:54,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:54,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:54,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:54,527 INFO L87 Difference]: Start difference. First operand 282 states and 359 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:54,807 INFO L93 Difference]: Finished difference Result 294 states and 370 transitions. [2022-11-03 01:56:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-03 01:56:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:54,810 INFO L225 Difference]: With dead ends: 294 [2022-11-03 01:56:54,810 INFO L226 Difference]: Without dead ends: 278 [2022-11-03 01:56:54,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:54,811 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 9 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:54,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1155 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-03 01:56:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-03 01:56:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 230 states have (on average 1.2478260869565216) internal successors, (287), 236 states have internal predecessors, (287), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (34), 27 states have call predecessors, (34), 27 states have call successors, (34) [2022-11-03 01:56:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 353 transitions. [2022-11-03 01:56:54,851 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 353 transitions. Word has length 35 [2022-11-03 01:56:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:54,851 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 353 transitions. [2022-11-03 01:56:54,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 353 transitions. [2022-11-03 01:56:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:56:54,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:54,853 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:54,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 01:56:54,853 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -608813596, now seen corresponding path program 1 times [2022-11-03 01:56:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:54,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655366308] [2022-11-03 01:56:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:55,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:55,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655366308] [2022-11-03 01:56:55,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655366308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:55,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:55,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441593565] [2022-11-03 01:56:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:55,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:55,060 INFO L87 Difference]: Start difference. First operand 278 states and 353 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:55,421 INFO L93 Difference]: Finished difference Result 321 states and 406 transitions. [2022-11-03 01:56:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:56:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-03 01:56:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:55,423 INFO L225 Difference]: With dead ends: 321 [2022-11-03 01:56:55,423 INFO L226 Difference]: Without dead ends: 318 [2022-11-03 01:56:55,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:55,424 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 680 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:55,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 573 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-03 01:56:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 278. [2022-11-03 01:56:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 230 states have (on average 1.2478260869565216) internal successors, (287), 236 states have internal predecessors, (287), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (34), 27 states have call predecessors, (34), 27 states have call successors, (34) [2022-11-03 01:56:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 353 transitions. [2022-11-03 01:56:55,467 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 353 transitions. Word has length 36 [2022-11-03 01:56:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:55,468 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 353 transitions. [2022-11-03 01:56:55,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 353 transitions. [2022-11-03 01:56:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 01:56:55,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:55,469 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:55,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 01:56:55,470 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash 846819988, now seen corresponding path program 1 times [2022-11-03 01:56:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:55,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992234024] [2022-11-03 01:56:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:55,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992234024] [2022-11-03 01:56:55,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992234024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:55,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:55,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:56:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279478045] [2022-11-03 01:56:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:55,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:55,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:55,550 INFO L87 Difference]: Start difference. First operand 278 states and 353 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:55,709 INFO L93 Difference]: Finished difference Result 288 states and 362 transitions. [2022-11-03 01:56:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:55,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-03 01:56:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:55,717 INFO L225 Difference]: With dead ends: 288 [2022-11-03 01:56:55,718 INFO L226 Difference]: Without dead ends: 255 [2022-11-03 01:56:55,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:55,720 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:55,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 958 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-03 01:56:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2022-11-03 01:56:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 208 states have (on average 1.2211538461538463) internal successors, (254), 212 states have internal predecessors, (254), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-11-03 01:56:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 316 transitions. [2022-11-03 01:56:55,757 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 316 transitions. Word has length 35 [2022-11-03 01:56:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:55,758 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 316 transitions. [2022-11-03 01:56:55,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 316 transitions. [2022-11-03 01:56:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 01:56:55,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:55,759 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 01:56:55,760 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -118036125, now seen corresponding path program 1 times [2022-11-03 01:56:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:55,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76601471] [2022-11-03 01:56:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:55,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:55,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76601471] [2022-11-03 01:56:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76601471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031918230] [2022-11-03 01:56:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:55,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:55,824 INFO L87 Difference]: Start difference. First operand 253 states and 316 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:56:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:55,978 INFO L93 Difference]: Finished difference Result 268 states and 330 transitions. [2022-11-03 01:56:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-03 01:56:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:55,981 INFO L225 Difference]: With dead ends: 268 [2022-11-03 01:56:55,981 INFO L226 Difference]: Without dead ends: 248 [2022-11-03 01:56:55,981 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:56:55,982 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 21 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:55,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 692 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-03 01:56:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-03 01:56:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 208 states have internal predecessors, (250), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (31), 26 states have call predecessors, (31), 25 states have call successors, (31) [2022-11-03 01:56:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2022-11-03 01:56:56,020 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 38 [2022-11-03 01:56:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:56,020 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2022-11-03 01:56:56,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:56:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2022-11-03 01:56:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 01:56:56,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:56,022 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:56,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 01:56:56,022 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1347688015, now seen corresponding path program 1 times [2022-11-03 01:56:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:56,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852832253] [2022-11-03 01:56:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:56,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852832253] [2022-11-03 01:56:56,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852832253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:56,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:56,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:56:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629609903] [2022-11-03 01:56:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:56,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:56,174 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:56,473 INFO L93 Difference]: Finished difference Result 261 states and 322 transitions. [2022-11-03 01:56:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:56:56,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-03 01:56:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:56,475 INFO L225 Difference]: With dead ends: 261 [2022-11-03 01:56:56,476 INFO L226 Difference]: Without dead ends: 244 [2022-11-03 01:56:56,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:56:56,477 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 18 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:56,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1129 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-03 01:56:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-11-03 01:56:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 202 states have (on average 1.2178217821782178) internal successors, (246), 205 states have internal predecessors, (246), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (30), 25 states have call predecessors, (30), 24 states have call successors, (30) [2022-11-03 01:56:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2022-11-03 01:56:56,515 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 38 [2022-11-03 01:56:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:56,516 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2022-11-03 01:56:56,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2022-11-03 01:56:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 01:56:56,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:56,517 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:56,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 01:56:56,518 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash -670626414, now seen corresponding path program 1 times [2022-11-03 01:56:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:56,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496945552] [2022-11-03 01:56:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:56,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:56,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496945552] [2022-11-03 01:56:56,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496945552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:56,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:56,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:56:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575997389] [2022-11-03 01:56:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:56,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:56,669 INFO L87 Difference]: Start difference. First operand 244 states and 304 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:56,954 INFO L93 Difference]: Finished difference Result 257 states and 316 transitions. [2022-11-03 01:56:56,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:56:56,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-03 01:56:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:56,956 INFO L225 Difference]: With dead ends: 257 [2022-11-03 01:56:56,956 INFO L226 Difference]: Without dead ends: 240 [2022-11-03 01:56:56,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:56:56,957 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 18 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:56,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1094 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-03 01:56:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-11-03 01:56:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.2160804020100502) internal successors, (242), 202 states have internal predecessors, (242), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (29), 24 states have call predecessors, (29), 23 states have call successors, (29) [2022-11-03 01:56:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2022-11-03 01:56:57,014 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 38 [2022-11-03 01:56:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:57,015 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2022-11-03 01:56:57,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2022-11-03 01:56:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 01:56:57,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:57,016 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:57,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 01:56:57,017 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1566491361, now seen corresponding path program 1 times [2022-11-03 01:56:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:57,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425012708] [2022-11-03 01:56:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:57,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:57,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:57,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425012708] [2022-11-03 01:56:57,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425012708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:57,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:57,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:56:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093139390] [2022-11-03 01:56:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:57,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:57,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:57,185 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:57,460 INFO L93 Difference]: Finished difference Result 253 states and 310 transitions. [2022-11-03 01:56:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:56:57,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-03 01:56:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:57,462 INFO L225 Difference]: With dead ends: 253 [2022-11-03 01:56:57,462 INFO L226 Difference]: Without dead ends: 236 [2022-11-03 01:56:57,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:56:57,463 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 18 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:57,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1066 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-03 01:56:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-11-03 01:56:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.2142857142857142) internal successors, (238), 199 states have internal predecessors, (238), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2022-11-03 01:56:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 292 transitions. [2022-11-03 01:56:57,499 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 292 transitions. Word has length 39 [2022-11-03 01:56:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:57,499 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 292 transitions. [2022-11-03 01:56:57,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 292 transitions. [2022-11-03 01:56:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 01:56:57,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:57,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:57,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-03 01:56:57,502 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -906307912, now seen corresponding path program 1 times [2022-11-03 01:56:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:57,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750588321] [2022-11-03 01:56:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:57,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750588321] [2022-11-03 01:56:57,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750588321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:57,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:57,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:56:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193888564] [2022-11-03 01:56:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:57,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:57,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:57,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:57,649 INFO L87 Difference]: Start difference. First operand 236 states and 292 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:56:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:57,985 INFO L93 Difference]: Finished difference Result 289 states and 363 transitions. [2022-11-03 01:56:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-11-03 01:56:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:57,987 INFO L225 Difference]: With dead ends: 289 [2022-11-03 01:56:57,988 INFO L226 Difference]: Without dead ends: 285 [2022-11-03 01:56:57,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:57,988 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 245 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:57,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 461 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-03 01:56:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 221. [2022-11-03 01:56:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 185 states have (on average 1.2162162162162162) internal successors, (225), 188 states have internal predecessors, (225), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-11-03 01:56:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2022-11-03 01:56:58,024 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 42 [2022-11-03 01:56:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:58,024 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2022-11-03 01:56:58,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:56:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2022-11-03 01:56:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 01:56:58,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:58,030 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:58,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-03 01:56:58,030 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1111154055, now seen corresponding path program 1 times [2022-11-03 01:56:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:58,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828352926] [2022-11-03 01:56:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:58,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:58,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828352926] [2022-11-03 01:56:58,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828352926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:58,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:58,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:56:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570599912] [2022-11-03 01:56:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:56:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:56:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:58,185 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:58,458 INFO L93 Difference]: Finished difference Result 234 states and 283 transitions. [2022-11-03 01:56:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:56:58,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-03 01:56:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:58,460 INFO L225 Difference]: With dead ends: 234 [2022-11-03 01:56:58,460 INFO L226 Difference]: Without dead ends: 209 [2022-11-03 01:56:58,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:56:58,461 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 20 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:58,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1002 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-03 01:56:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-11-03 01:56:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.2159090909090908) internal successors, (214), 179 states have internal predecessors, (214), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2022-11-03 01:56:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 256 transitions. [2022-11-03 01:56:58,494 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 256 transitions. Word has length 41 [2022-11-03 01:56:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:58,494 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 256 transitions. [2022-11-03 01:56:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 256 transitions. [2022-11-03 01:56:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 01:56:58,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:58,496 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 01:56:58,496 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 437978475, now seen corresponding path program 1 times [2022-11-03 01:56:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:58,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504446400] [2022-11-03 01:56:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:58,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:58,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504446400] [2022-11-03 01:56:58,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504446400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:58,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:56:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933611298] [2022-11-03 01:56:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:58,626 INFO L87 Difference]: Start difference. First operand 209 states and 256 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:58,850 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2022-11-03 01:56:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:58,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-03 01:56:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:58,852 INFO L225 Difference]: With dead ends: 220 [2022-11-03 01:56:58,853 INFO L226 Difference]: Without dead ends: 190 [2022-11-03 01:56:58,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:58,854 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 9 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:58,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 808 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-03 01:56:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-03 01:56:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.2278481012658229) internal successors, (194), 161 states have internal predecessors, (194), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (20), 17 states have call predecessors, (20), 17 states have call successors, (20) [2022-11-03 01:56:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 234 transitions. [2022-11-03 01:56:58,885 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 234 transitions. Word has length 42 [2022-11-03 01:56:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:58,885 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 234 transitions. [2022-11-03 01:56:58,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:56:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 234 transitions. [2022-11-03 01:56:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-03 01:56:58,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:58,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 01:56:58,887 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:58,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1641822764, now seen corresponding path program 1 times [2022-11-03 01:56:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:58,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593671755] [2022-11-03 01:56:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:56:59,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:59,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593671755] [2022-11-03 01:56:59,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593671755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:59,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:59,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:56:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66822819] [2022-11-03 01:56:59,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:59,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:56:59,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:56:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:59,175 INFO L87 Difference]: Start difference. First operand 190 states and 234 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:59,607 INFO L93 Difference]: Finished difference Result 240 states and 303 transitions. [2022-11-03 01:56:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:56:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-11-03 01:56:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:59,609 INFO L225 Difference]: With dead ends: 240 [2022-11-03 01:56:59,609 INFO L226 Difference]: Without dead ends: 237 [2022-11-03 01:56:59,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:56:59,610 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 589 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:59,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 571 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:56:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-03 01:56:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 193. [2022-11-03 01:56:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 161 states have (on average 1.236024844720497) internal successors, (199), 164 states have internal predecessors, (199), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (20), 17 states have call predecessors, (20), 17 states have call successors, (20) [2022-11-03 01:56:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2022-11-03 01:56:59,642 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 49 [2022-11-03 01:56:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:59,643 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2022-11-03 01:56:59,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:56:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2022-11-03 01:56:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:56:59,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:59,644 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:56:59,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-03 01:56:59,644 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:56:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1668157851, now seen corresponding path program 1 times [2022-11-03 01:56:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:59,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092890580] [2022-11-03 01:56:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:59,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:59,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092890580] [2022-11-03 01:56:59,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092890580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:59,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:59,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299733901] [2022-11-03 01:56:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:59,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:59,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:59,717 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:56:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:59,955 INFO L93 Difference]: Finished difference Result 398 states and 479 transitions. [2022-11-03 01:56:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-03 01:56:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:59,958 INFO L225 Difference]: With dead ends: 398 [2022-11-03 01:56:59,958 INFO L226 Difference]: Without dead ends: 257 [2022-11-03 01:56:59,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:59,959 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 156 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:59,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 404 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-03 01:57:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2022-11-03 01:57:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 200 states have (on average 1.225) internal successors, (245), 205 states have internal predecessors, (245), 22 states have call successors, (22), 17 states have call predecessors, (22), 18 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-03 01:57:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 290 transitions. [2022-11-03 01:57:00,007 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 290 transitions. Word has length 50 [2022-11-03 01:57:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:00,008 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 290 transitions. [2022-11-03 01:57:00,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 290 transitions. [2022-11-03 01:57:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 01:57:00,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:00,009 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:57:00,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-03 01:57:00,010 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:00,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 950524592, now seen corresponding path program 1 times [2022-11-03 01:57:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:00,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220268728] [2022-11-03 01:57:00,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:00,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:00,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220268728] [2022-11-03 01:57:00,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220268728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:00,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:00,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:57:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032655162] [2022-11-03 01:57:00,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:00,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:57:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:57:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:57:00,093 INFO L87 Difference]: Start difference. First operand 241 states and 290 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:00,205 INFO L93 Difference]: Finished difference Result 278 states and 326 transitions. [2022-11-03 01:57:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:57:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-11-03 01:57:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:00,207 INFO L225 Difference]: With dead ends: 278 [2022-11-03 01:57:00,207 INFO L226 Difference]: Without dead ends: 241 [2022-11-03 01:57:00,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:57:00,208 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:00,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:57:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-03 01:57:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-03 01:57:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 200 states have (on average 1.22) internal successors, (244), 205 states have internal predecessors, (244), 22 states have call successors, (22), 17 states have call predecessors, (22), 18 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-03 01:57:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2022-11-03 01:57:00,249 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 51 [2022-11-03 01:57:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:00,249 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2022-11-03 01:57:00,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2022-11-03 01:57:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:57:00,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:00,251 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:57:00,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-03 01:57:00,251 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1458743820, now seen corresponding path program 1 times [2022-11-03 01:57:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:00,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586724359] [2022-11-03 01:57:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:00,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:00,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586724359] [2022-11-03 01:57:00,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586724359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:00,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:00,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 01:57:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756760121] [2022-11-03 01:57:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:00,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:57:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:57:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:57:00,556 INFO L87 Difference]: Start difference. First operand 241 states and 289 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:57:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:01,550 INFO L93 Difference]: Finished difference Result 258 states and 306 transitions. [2022-11-03 01:57:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:57:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-03 01:57:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:01,552 INFO L225 Difference]: With dead ends: 258 [2022-11-03 01:57:01,552 INFO L226 Difference]: Without dead ends: 241 [2022-11-03 01:57:01,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2022-11-03 01:57:01,553 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 342 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:01,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 605 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:57:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-03 01:57:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-03 01:57:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 200 states have (on average 1.215) internal successors, (243), 205 states have internal predecessors, (243), 22 states have call successors, (22), 17 states have call predecessors, (22), 18 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-03 01:57:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 288 transitions. [2022-11-03 01:57:01,598 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 288 transitions. Word has length 50 [2022-11-03 01:57:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:01,598 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 288 transitions. [2022-11-03 01:57:01,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:57:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 288 transitions. [2022-11-03 01:57:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:57:01,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:01,600 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:57:01,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-03 01:57:01,601 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1812032689, now seen corresponding path program 1 times [2022-11-03 01:57:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:01,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11754767] [2022-11-03 01:57:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:01,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:01,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:01,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11754767] [2022-11-03 01:57:01,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11754767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:01,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:01,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:57:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194140638] [2022-11-03 01:57:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:01,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:57:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:57:01,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:57:01,692 INFO L87 Difference]: Start difference. First operand 241 states and 288 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:57:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:01,869 INFO L93 Difference]: Finished difference Result 335 states and 398 transitions. [2022-11-03 01:57:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:57:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-03 01:57:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:01,871 INFO L225 Difference]: With dead ends: 335 [2022-11-03 01:57:01,871 INFO L226 Difference]: Without dead ends: 250 [2022-11-03 01:57:01,872 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:57:01,872 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 35 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:01,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 596 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:57:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-03 01:57:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-03 01:57:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 208 states have (on average 1.1682692307692308) internal successors, (243), 214 states have internal predecessors, (243), 23 states have call successors, (23), 17 states have call predecessors, (23), 18 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-03 01:57:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 289 transitions. [2022-11-03 01:57:01,918 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 289 transitions. Word has length 50 [2022-11-03 01:57:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:01,919 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 289 transitions. [2022-11-03 01:57:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:57:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 289 transitions. [2022-11-03 01:57:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 01:57:01,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:01,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:01,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-03 01:57:01,921 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1599549463, now seen corresponding path program 1 times [2022-11-03 01:57:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:01,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680858276] [2022-11-03 01:57:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:57:02,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:02,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680858276] [2022-11-03 01:57:02,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680858276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:02,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:02,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222558633] [2022-11-03 01:57:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:02,003 INFO L87 Difference]: Start difference. First operand 250 states and 289 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:02,098 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2022-11-03 01:57:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-03 01:57:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:02,100 INFO L225 Difference]: With dead ends: 272 [2022-11-03 01:57:02,100 INFO L226 Difference]: Without dead ends: 263 [2022-11-03 01:57:02,101 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:57:02,101 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 25 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:02,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 230 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:57:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-03 01:57:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2022-11-03 01:57:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 207 states have (on average 1.1642512077294687) internal successors, (241), 213 states have internal predecessors, (241), 23 states have call successors, (23), 17 states have call predecessors, (23), 18 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-03 01:57:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 287 transitions. [2022-11-03 01:57:02,148 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 287 transitions. Word has length 52 [2022-11-03 01:57:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:02,149 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 287 transitions. [2022-11-03 01:57:02,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2022-11-03 01:57:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-03 01:57:02,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:02,150 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:57:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-03 01:57:02,151 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1353782481, now seen corresponding path program 1 times [2022-11-03 01:57:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378748115] [2022-11-03 01:57:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:02,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:02,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378748115] [2022-11-03 01:57:02,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378748115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:02,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:02,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:57:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132070920] [2022-11-03 01:57:02,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:02,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:57:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:02,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:57:02,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:57:02,230 INFO L87 Difference]: Start difference. First operand 249 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:02,336 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2022-11-03 01:57:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:57:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-11-03 01:57:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:02,338 INFO L225 Difference]: With dead ends: 251 [2022-11-03 01:57:02,338 INFO L226 Difference]: Without dead ends: 206 [2022-11-03 01:57:02,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:57:02,340 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:02,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:57:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-03 01:57:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-11-03 01:57:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 176 states have internal predecessors, (202), 19 states have call successors, (19), 14 states have call predecessors, (19), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-03 01:57:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 241 transitions. [2022-11-03 01:57:02,380 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 241 transitions. Word has length 53 [2022-11-03 01:57:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:02,380 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 241 transitions. [2022-11-03 01:57:02,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 241 transitions. [2022-11-03 01:57:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 01:57:02,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:02,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:02,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-03 01:57:02,382 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1429365630, now seen corresponding path program 1 times [2022-11-03 01:57:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:02,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508106117] [2022-11-03 01:57:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:57:02,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:02,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508106117] [2022-11-03 01:57:02,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508106117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:02,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:02,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:57:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283351443] [2022-11-03 01:57:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:02,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:57:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:57:02,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:57:02,657 INFO L87 Difference]: Start difference. First operand 206 states and 241 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:02,891 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2022-11-03 01:57:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:57:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-11-03 01:57:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:02,893 INFO L225 Difference]: With dead ends: 215 [2022-11-03 01:57:02,893 INFO L226 Difference]: Without dead ends: 209 [2022-11-03 01:57:02,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:57:02,894 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 184 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:02,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 316 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:57:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-03 01:57:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 150. [2022-11-03 01:57:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.144) internal successors, (143), 128 states have internal predecessors, (143), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-03 01:57:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2022-11-03 01:57:02,929 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 54 [2022-11-03 01:57:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:02,929 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2022-11-03 01:57:02,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2022-11-03 01:57:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-03 01:57:02,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:02,931 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:57:02,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-03 01:57:02,931 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1071645173, now seen corresponding path program 1 times [2022-11-03 01:57:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:02,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011003155] [2022-11-03 01:57:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:02,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011003155] [2022-11-03 01:57:02,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011003155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:02,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:02,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:57:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714485397] [2022-11-03 01:57:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:02,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:57:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:57:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:57:02,990 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:57:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:03,078 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2022-11-03 01:57:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:57:03,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-11-03 01:57:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:03,080 INFO L225 Difference]: With dead ends: 189 [2022-11-03 01:57:03,080 INFO L226 Difference]: Without dead ends: 150 [2022-11-03 01:57:03,081 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:57:03,081 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:03,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 268 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:57:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-03 01:57:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-03 01:57:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.136) internal successors, (142), 128 states have internal predecessors, (142), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-03 01:57:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2022-11-03 01:57:03,112 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 55 [2022-11-03 01:57:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:03,113 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2022-11-03 01:57:03,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:57:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-11-03 01:57:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-03 01:57:03,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:03,114 INFO L195 NwaCegarLoop]: 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] [2022-11-03 01:57:03,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-03 01:57:03,115 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash 74281912, now seen corresponding path program 1 times [2022-11-03 01:57:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:03,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030686625] [2022-11-03 01:57:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:03,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:03,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030686625] [2022-11-03 01:57:03,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030686625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:03,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:03,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:57:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430036823] [2022-11-03 01:57:03,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:03,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:57:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:57:03,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:57:03,199 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:03,376 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-11-03 01:57:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:57:03,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-11-03 01:57:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:03,377 INFO L225 Difference]: With dead ends: 188 [2022-11-03 01:57:03,377 INFO L226 Difference]: Without dead ends: 127 [2022-11-03 01:57:03,378 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:57:03,378 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 151 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:03,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 362 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:57:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-03 01:57:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2022-11-03 01:57:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.119047619047619) internal successors, (94), 84 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:57:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-11-03 01:57:03,401 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 57 [2022-11-03 01:57:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:03,401 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-11-03 01:57:03,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-11-03 01:57:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-03 01:57:03,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:03,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-03 01:57:03,403 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 94907509, now seen corresponding path program 1 times [2022-11-03 01:57:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441457816] [2022-11-03 01:57:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:57:03,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441457816] [2022-11-03 01:57:03,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441457816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:03,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:03,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:57:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146027927] [2022-11-03 01:57:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:03,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:57:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:57:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:57:03,557 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:03,691 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-11-03 01:57:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:57:03,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 69 [2022-11-03 01:57:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:03,694 INFO L225 Difference]: With dead ends: 121 [2022-11-03 01:57:03,694 INFO L226 Difference]: Without dead ends: 95 [2022-11-03 01:57:03,694 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:57:03,695 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 123 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:03,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 271 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:57:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-03 01:57:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-03 01:57:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 81 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:57:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-03 01:57:03,716 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 69 [2022-11-03 01:57:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:03,717 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-03 01:57:03,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-03 01:57:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-03 01:57:03,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:03,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-03 01:57:03,719 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:03,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1011179466, now seen corresponding path program 1 times [2022-11-03 01:57:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:03,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729751497] [2022-11-03 01:57:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:57:04,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729751497] [2022-11-03 01:57:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729751497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:04,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 01:57:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308633485] [2022-11-03 01:57:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 01:57:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 01:57:04,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:57:04,264 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:05,465 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2022-11-03 01:57:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:57:05,466 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-11-03 01:57:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:05,467 INFO L225 Difference]: With dead ends: 131 [2022-11-03 01:57:05,467 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 01:57:05,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:57:05,468 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 283 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:05,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 427 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:57:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 01:57:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-03 01:57:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 81 states have internal predecessors, (87), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:57:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2022-11-03 01:57:05,492 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 71 [2022-11-03 01:57:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:05,492 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2022-11-03 01:57:05,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:57:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-11-03 01:57:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-03 01:57:05,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:05,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:05,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-03 01:57:05,494 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1383685232, now seen corresponding path program 1 times [2022-11-03 01:57:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:05,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373943422] [2022-11-03 01:57:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:57:05,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:05,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373943422] [2022-11-03 01:57:05,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373943422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:05,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:05,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 01:57:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25646382] [2022-11-03 01:57:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:05,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:57:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:57:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:57:05,736 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 01:57:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:06,015 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-11-03 01:57:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:57:06,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-11-03 01:57:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:06,016 INFO L225 Difference]: With dead ends: 104 [2022-11-03 01:57:06,017 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:57:06,017 INFO L412 NwaCegarLoop]: 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 [2022-11-03 01:57:06,018 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 185 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:06,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 279 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:57:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:57:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:57:06,019 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) [2022-11-03 01:57:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:57:06,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2022-11-03 01:57:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:57:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 01:57:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:57:06,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:57:06,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:57:06,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-03 01:57:06,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:57:24,488 INFO L899 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 1061 1102) no Hoare annotation was computed. [2022-11-03 01:57:24,489 INFO L895 garLoopResultBuilder]: At program point L1074(lines 1066 1085) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (let ((.cse6 (not (= ~MPR3~0 |old(~s~0)|)))) (or .cse0 .cse1 .cse2 (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= |old(~setEventCalled~0)| 1)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1) .cse5 .cse6) (not (= ~compRegistered~0 1)) (and .cse7 .cse6) (not (= ~pended~0 0)))) (or .cse0 .cse1 .cse2 .cse7 (not (= ~compRegistered~0 0)) (not (= ~pended~0 1)) .cse3 .cse4 .cse5 (= ~MPR3~0 1)))) [2022-11-03 01:57:24,490 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1085) no Hoare annotation was computed. [2022-11-03 01:57:24,490 INFO L895 garLoopResultBuilder]: At program point L1081(line 1081) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse3 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) (not (= ~pended~0 1)) .cse4 .cse5 (= ~MPR3~0 1)) (or .cse0 .cse1 .cse2 (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse4 (not (<= 6 ~MPR3~0)) .cse5 (not (= |old(~setEventCalled~0)| 1)) (not (= ~compRegistered~0 1)) (and .cse3 (not (= ~MPR3~0 |old(~s~0)|))) (not (= ~pended~0 0))))) [2022-11-03 01:57:24,490 INFO L899 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2022-11-03 01:57:24,491 INFO L895 garLoopResultBuilder]: At program point L1079-1(lines 1066 1085) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse4 (= ~s~0 ~NP~0)) (.cse3 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) (not (= ~pended~0 1)) .cse4 .cse5 .cse6 (= ~MPR3~0 1)) (let ((.cse7 (not (= ~MPR3~0 |old(~s~0)|)))) (or .cse0 .cse1 .cse2 (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse5 (not (<= 6 ~MPR3~0)) .cse6 (not (= |old(~setEventCalled~0)| 1)) (and (= |old(~customIrp~0)| ~customIrp~0) .cse4) (not (= ~compRegistered~0 1)) (and (= ~setEventCalled~0 1) (= |old(~customIrp~0)| 1) (= ~customIrp~0 0) (= ~s~0 |old(~s~0)|) .cse7) (and .cse3 .cse7) (not (= ~pended~0 0)))))) [2022-11-03 01:57:24,491 INFO L899 garLoopResultBuilder]: For program point L1067(lines 1067 1072) no Hoare annotation was computed. [2022-11-03 01:57:24,492 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 1061 1102) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse6 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse3 (= ~s~0 |old(~s~0)|))) (and (or .cse0 .cse1 .cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1) .cse3) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse4 (not (<= 6 ~MPR3~0)) .cse5 (not (= |old(~setEventCalled~0)| 1)) (not (= ~compRegistered~0 1)) (and .cse6 (not (= ~MPR3~0 |old(~s~0)|))) (not (= ~pended~0 0))) (or .cse0 .cse1 .cse2 .cse6 (not (= ~compRegistered~0 0)) (not (= ~pended~0 1)) .cse4 .cse5 .cse3 (= ~MPR3~0 1)))) [2022-11-03 01:57:24,492 INFO L899 garLoopResultBuilder]: For program point IoSetDeviceInterfaceStateEXIT(lines 931 951) no Hoare annotation was computed. [2022-11-03 01:57:24,492 INFO L902 garLoopResultBuilder]: At program point IoSetDeviceInterfaceStateENTRY(lines 931 951) the Hoare annotation is: true [2022-11-03 01:57:24,493 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 1039 1052) the Hoare annotation is: (let ((.cse2 (not (= ~compRegistered~0 0))) (.cse3 (= ~s~0 ~NP~0)) (.cse0 (not (= ~SKIP1~0 3))) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~pended~0 1)) .cse3) (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~NP~0 1)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) .cse0 .cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 6 ~MPR3~0)) (not (<= (+ 5 ~DC~0) ~IPC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1)) .cse4))) [2022-11-03 01:57:24,493 INFO L895 garLoopResultBuilder]: At program point L1047(line 1047) the Hoare annotation is: (let ((.cse0 (not (= ~SKIP1~0 3))) (.cse1 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~pended~0 1))) (or (not (= ~NP~0 1)) (not (<= (+ 2 ~DC~0) ~SKIP2~0)) .cse0 .cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 6 ~MPR3~0)) (not (<= (+ 5 ~DC~0) ~IPC~0)) (not (= ~compRegistered~0 1)) .cse3) (or .cse0 .cse1 .cse2 .cse3))) [2022-11-03 01:57:24,493 INFO L899 garLoopResultBuilder]: For program point L1047-1(lines 1039 1052) no Hoare annotation was computed. [2022-11-03 01:57:24,493 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 1039 1052) no Hoare annotation was computed. [2022-11-03 01:57:24,493 INFO L899 garLoopResultBuilder]: For program point L1043(lines 1043 1049) no Hoare annotation was computed. [2022-11-03 01:57:24,494 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 1623 1630) the Hoare annotation is: true [2022-11-03 01:57:24,494 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 1623 1630) no Hoare annotation was computed. [2022-11-03 01:57:24,494 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2022-11-03 01:57:24,495 INFO L895 garLoopResultBuilder]: At program point L795(lines 788 834) the Hoare annotation is: (let ((.cse4 (= ~s~0 ~DC~0)) (.cse10 (= ~NP~0 1)) (.cse11 (not (= ~MPR3~0 1))) (.cse12 (= ~compRegistered~0 0)) (.cse13 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 3))) (let ((.cse6 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0)) (.cse1 (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|))) (.cse8 (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1))) (.cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|)) (.cse0 (or (and (= ~compRegistered~0 1) .cse4 .cse10 .cse11 .cse13 .cse5) (and .cse4 .cse10 .cse11 .cse12 .cse13 .cse5))) (.cse7 (= ~pended~0 1)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse14 (= ~SKIP2~0 ~s~0))) (or (and (<= 6 ~MPR3~0) .cse0 .cse1 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (or (<= |ULTIMATE.start_FloppyPnp_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res#1|)) .cse2 .cse3) (and .cse4 (= |ULTIMATE.start_main_~status~1#1| 0) .cse5) (and (<= (+ 1073741738 |ULTIMATE.start_FloppyDeviceControl_#res#1|) 0) .cse4 .cse6 .cse5) (and .cse4 .cse7 .cse5) (and .cse4 .cse6 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse5) (and (or (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res#1|)) .cse0 (or (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|) (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 259)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|)) .cse1 (or (not (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 258)) (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1|)) .cse2 .cse3) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse8 .cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse2 .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse5) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res#1|) (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| ~lowerDriverReturn~0) .cse8 .cse9 .cse2 .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse5) (and .cse0 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_~ntStatus~4#1| 1073741536) 0) .cse3) (and .cse7 .cse2 .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1)) .cse5)))) [2022-11-03 01:57:24,495 INFO L895 garLoopResultBuilder]: At program point L597(line 597) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (= ~pended~0 0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP1~0 3))) (or (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse5 .cse6 .cse7 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)))) [2022-11-03 01:57:24,496 INFO L895 garLoopResultBuilder]: At program point L597-1(line 597) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse4 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse9 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse10 (= ~pended~0 0)) (.cse11 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse12 (= ~SKIP1~0 3))) (or (let ((.cse2 (not (= ~s~0 1)))) (and .cse0 .cse1 (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258) .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|) .cse2) .cse9 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse10 .cse11 .cse12)) (and .cse0 .cse1 .cse3 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and .cse0 .cse1 .cse3 .cse4 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-03 01:57:24,496 INFO L895 garLoopResultBuilder]: At program point L531(lines 531 541) the Hoare annotation is: (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,497 INFO L895 garLoopResultBuilder]: At program point L498(line 498) the Hoare annotation is: false [2022-11-03 01:57:24,497 INFO L899 garLoopResultBuilder]: For program point L1489(line 1489) no Hoare annotation was computed. [2022-11-03 01:57:24,497 INFO L899 garLoopResultBuilder]: For program point L1357(lines 1357 1540) no Hoare annotation was computed. [2022-11-03 01:57:24,497 INFO L899 garLoopResultBuilder]: For program point L796(lines 780 835) no Hoare annotation was computed. [2022-11-03 01:57:24,497 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 778) no Hoare annotation was computed. [2022-11-03 01:57:24,497 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 307) no Hoare annotation was computed. [2022-11-03 01:57:24,498 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 832) no Hoare annotation was computed. [2022-11-03 01:57:24,498 INFO L895 garLoopResultBuilder]: At program point L731(lines 730 778) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,498 INFO L895 garLoopResultBuilder]: At program point L1293(line 1293) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,498 INFO L899 garLoopResultBuilder]: For program point L1293-1(line 1293) no Hoare annotation was computed. [2022-11-03 01:57:24,498 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,502 INFO L899 garLoopResultBuilder]: For program point L236-1(lines 229 417) no Hoare annotation was computed. [2022-11-03 01:57:24,503 INFO L899 garLoopResultBuilder]: For program point L203-1(line 203) no Hoare annotation was computed. [2022-11-03 01:57:24,504 INFO L899 garLoopResultBuilder]: For program point L798(lines 798 831) no Hoare annotation was computed. [2022-11-03 01:57:24,504 INFO L895 garLoopResultBuilder]: At program point L633(line 633) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,504 INFO L899 garLoopResultBuilder]: For program point L633-1(line 633) no Hoare annotation was computed. [2022-11-03 01:57:24,505 INFO L895 garLoopResultBuilder]: At program point L567(lines 528 593) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (= ~pended~0 0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP1~0 3))) (or (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse5 .cse6 .cse7 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)))) [2022-11-03 01:57:24,505 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (= ~SKIP1~0 3))) (or (and (= ~pended~0 1) .cse0 .cse1 .cse2 .cse3) (and (or (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|) (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 259)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|)) (or (not (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 258)) (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1|)) .cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) .cse1 (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) .cse2 (<= (+ 2 ~DC~0) ~SKIP2~0) .cse3))) [2022-11-03 01:57:24,505 INFO L899 garLoopResultBuilder]: For program point L1591-2(lines 1589 1620) no Hoare annotation was computed. [2022-11-03 01:57:24,505 INFO L895 garLoopResultBuilder]: At program point L336(line 336) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (= ~s~0 ~NP~0) (= ~myStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,506 INFO L899 garLoopResultBuilder]: For program point L336-1(line 336) no Hoare annotation was computed. [2022-11-03 01:57:24,506 INFO L899 garLoopResultBuilder]: For program point L799(lines 799 809) no Hoare annotation was computed. [2022-11-03 01:57:24,506 INFO L895 garLoopResultBuilder]: At program point L1526(lines 1401 1527) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (= ~SKIP1~0 3))) (or (and (= ~pended~0 1) .cse0 .cse1 .cse2 .cse3) (and (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 0) .cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) .cse1 (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) .cse2 (<= (+ 2 ~DC~0) ~SKIP2~0) .cse3))) [2022-11-03 01:57:24,506 INFO L895 garLoopResultBuilder]: At program point L370(line 370) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,506 INFO L899 garLoopResultBuilder]: For program point L370-1(line 370) no Hoare annotation was computed. [2022-11-03 01:57:24,507 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 277) no Hoare annotation was computed. [2022-11-03 01:57:24,507 INFO L899 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2022-11-03 01:57:24,507 INFO L899 garLoopResultBuilder]: For program point L1362(lines 1362 1538) no Hoare annotation was computed. [2022-11-03 01:57:24,507 INFO L895 garLoopResultBuilder]: At program point L305(line 305) the Hoare annotation is: false [2022-11-03 01:57:24,507 INFO L899 garLoopResultBuilder]: For program point L305-1(lines 301 307) no Hoare annotation was computed. [2022-11-03 01:57:24,512 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 777) no Hoare annotation was computed. [2022-11-03 01:57:24,512 INFO L895 garLoopResultBuilder]: At program point L1594-1(lines 1594 1618) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (= ~SKIP1~0 3))) (or (and (= ~pended~0 1) (= ~s~0 ~NP~0) .cse0 .cse1 .cse2) (and (= ~s~0 ~DC~0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_~ntStatus~4#1| 1073741536) 0) (= ~NP~0 1) (not (= ~MPR3~0 1)) .cse0 (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) .cse1 (<= (+ 2 ~DC~0) ~SKIP2~0) .cse2))) [2022-11-03 01:57:24,512 INFO L899 garLoopResultBuilder]: For program point L1462(lines 1462 1482) no Hoare annotation was computed. [2022-11-03 01:57:24,512 INFO L899 garLoopResultBuilder]: For program point L1330(lines 1330 1546) no Hoare annotation was computed. [2022-11-03 01:57:24,512 INFO L899 garLoopResultBuilder]: For program point L1297(lines 1297 1311) no Hoare annotation was computed. [2022-11-03 01:57:24,513 INFO L899 garLoopResultBuilder]: For program point L240(lines 240 246) no Hoare annotation was computed. [2022-11-03 01:57:24,513 INFO L895 garLoopResultBuilder]: At program point L207(lines 207 426) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,514 INFO L895 garLoopResultBuilder]: At program point L802(line 802) the Hoare annotation is: false [2022-11-03 01:57:24,514 INFO L895 garLoopResultBuilder]: At program point L736(lines 735 777) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,514 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 642) no Hoare annotation was computed. [2022-11-03 01:57:24,514 INFO L899 garLoopResultBuilder]: For program point L637-2(lines 637 642) no Hoare annotation was computed. [2022-11-03 01:57:24,515 INFO L895 garLoopResultBuilder]: At program point L1562(lines 1183 1564) the Hoare annotation is: (let ((.cse4 (= ~NP~0 1)) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse0 (= ~pended~0 1)) (.cse9 (= ~s~0 ~DC~0)) (.cse1 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (= ~pended~0 0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (= ~SKIP1~0 3))) (or (and .cse0 (= ~s~0 ~NP~0) .cse1 .cse2 .cse3) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res#1|) (<= 5 ~MPR1~0) (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| ~lowerDriverReturn~0) .cse4 .cse5 .cse1 .cse6 .cse7 .cse2 .cse8 (= ~SKIP2~0 ~s~0) .cse3) (and .cse9 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_~ntStatus~4#1| 1073741536) 0) .cse4 .cse5 .cse1 .cse6 .cse7 .cse2 .cse8 .cse3) (and (or (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res#1|)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|) (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 259)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|)) .cse9 (or (not (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 258)) (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1|)) (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse4 .cse5 .cse1 .cse6 .cse7 .cse2 .cse8 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse3) (and (<= (+ 1073741738 |ULTIMATE.start_FloppyDeviceControl_#res#1|) 0) .cse9 .cse1 .cse7 .cse2 .cse3))) [2022-11-03 01:57:24,515 INFO L899 garLoopResultBuilder]: For program point L1463(lines 1463 1466) no Hoare annotation was computed. [2022-11-03 01:57:24,515 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2022-11-03 01:57:24,515 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1304) no Hoare annotation was computed. [2022-11-03 01:57:24,516 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 340 345) no Hoare annotation was computed. [2022-11-03 01:57:24,516 INFO L895 garLoopResultBuilder]: At program point L275(line 275) the Hoare annotation is: false [2022-11-03 01:57:24,516 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 271 277) no Hoare annotation was computed. [2022-11-03 01:57:24,516 INFO L902 garLoopResultBuilder]: At program point L837(lines 667 839) the Hoare annotation is: true [2022-11-03 01:57:24,516 INFO L895 garLoopResultBuilder]: At program point L639(line 639) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258) (not (= ~s~0 1))) (= ~setEventCalled~0 1) (or .cse0 (<= 259 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|)) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or .cse0 (= ~MPR3~0 ~s~0)) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (or (= |ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0#1| 259) .cse0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3))) [2022-11-03 01:57:24,517 INFO L899 garLoopResultBuilder]: For program point L639-1(line 639) no Hoare annotation was computed. [2022-11-03 01:57:24,517 INFO L895 garLoopResultBuilder]: At program point L342(line 342) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) (not (= ~s~0 1))) (or .cse0 (= ~MPR3~0 ~s~0)) (= ~myStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (or (= |ULTIMATE.start_FloppyPnp_~__cil_tmp30~0#1| 259) .cse0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3))) [2022-11-03 01:57:24,517 INFO L899 garLoopResultBuilder]: For program point L342-1(line 342) no Hoare annotation was computed. [2022-11-03 01:57:24,517 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 425) no Hoare annotation was computed. [2022-11-03 01:57:24,517 INFO L895 garLoopResultBuilder]: At program point L508(line 508) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,518 INFO L899 garLoopResultBuilder]: For program point L508-1(line 508) no Hoare annotation was computed. [2022-11-03 01:57:24,518 INFO L895 garLoopResultBuilder]: At program point L409(line 409) the Hoare annotation is: false [2022-11-03 01:57:24,518 INFO L895 garLoopResultBuilder]: At program point L1400(lines 1390 1530) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,518 INFO L899 garLoopResultBuilder]: For program point L409-1(lines 405 411) no Hoare annotation was computed. [2022-11-03 01:57:24,518 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2022-11-03 01:57:24,518 INFO L899 garLoopResultBuilder]: For program point L244-1(lines 240 246) no Hoare annotation was computed. [2022-11-03 01:57:24,519 INFO L895 garLoopResultBuilder]: At program point L740(lines 740 776) the Hoare annotation is: (and (<= 6 ~MPR3~0) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,519 INFO L895 garLoopResultBuilder]: At program point L707(lines 707 779) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (<= 6 ~MPR3~0) (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1)) (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|) (= ~myStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (not (= ~MPR1~0 ~s~0)) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1)) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,520 INFO L895 garLoopResultBuilder]: At program point L707-1(lines 701 838) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0)) (.cse2 (= ~s~0 ~DC~0)) (.cse10 (= ~NP~0 1)) (.cse11 (not (= ~MPR3~0 1))) (.cse6 (= ~pended~0 0)) (.cse12 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 3))) (let ((.cse7 (<= 5 ~MPR1~0)) (.cse8 (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1))) (.cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|)) (.cse3 (= ~pended~0 1)) (.cse13 (= ~SKIP2~0 ~s~0)) (.cse14 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0)) (.cse0 (or (and .cse2 .cse10 .cse11 .cse6 .cse4 .cse12 .cse5) (and (= ~compRegistered~0 1) .cse2 .cse10 .cse11 .cse6 .cse12 .cse5))) (.cse15 (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|))) (.cse16 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= (+ 5 ~DC~0) ~IPC~0))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_~ntStatus~4#1| 1073741536) 0) .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse3 (= ~s~0 ~NP~0) .cse4 .cse5) (and .cse2 (= |ULTIMATE.start_main_~status~1#1| 0) .cse6 .cse5) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse7 .cse8 .cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse10 .cse11 .cse1 .cse6 .cse4 .cse12 .cse13 .cse5) (and (<= (+ 1073741738 |ULTIMATE.start_FloppyDeviceControl_#res#1|) 0) .cse2 .cse14 .cse6 .cse5) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res#1|) .cse7 (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 .cse1 .cse6 .cse4 .cse12 .cse13 .cse5) (and (or (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res#1|)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|) (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 259)) .cse0 (or (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|)) .cse15 (or (not (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 258)) (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1|)) .cse16 .cse1) (and .cse3 .cse16 .cse10 .cse11 .cse1 .cse4 .cse12 .cse13 .cse5) (and .cse2 .cse14 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse6 .cse5) (and (<= 6 ~MPR3~0) .cse0 .cse15 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (or (<= |ULTIMATE.start_FloppyPnp_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res#1|)) .cse16 .cse1)))) [2022-11-03 01:57:24,520 INFO L895 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,520 INFO L899 garLoopResultBuilder]: For program point L1599-1(line 1599) no Hoare annotation was computed. [2022-11-03 01:57:24,520 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 383) no Hoare annotation was computed. [2022-11-03 01:57:24,520 INFO L895 garLoopResultBuilder]: At program point L311(line 311) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,521 INFO L895 garLoopResultBuilder]: At program point L1302(line 1302) the Hoare annotation is: false [2022-11-03 01:57:24,521 INFO L899 garLoopResultBuilder]: For program point L311-1(line 311) no Hoare annotation was computed. [2022-11-03 01:57:24,521 INFO L899 garLoopResultBuilder]: For program point L1302-1(lines 1298 1304) no Hoare annotation was computed. [2022-11-03 01:57:24,521 INFO L895 garLoopResultBuilder]: At program point L543(lines 530 570) the Hoare annotation is: (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,521 INFO L899 garLoopResultBuilder]: For program point L1468(lines 1468 1481) no Hoare annotation was computed. [2022-11-03 01:57:24,522 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1536) no Hoare annotation was computed. [2022-11-03 01:57:24,522 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 424) no Hoare annotation was computed. [2022-11-03 01:57:24,523 INFO L895 garLoopResultBuilder]: At program point L214(lines 210 425) the Hoare annotation is: (and (<= 6 ~MPR3~0) (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,523 INFO L895 garLoopResultBuilder]: At program point L644(lines 612 646) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (= ~pended~0 0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP1~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res#1| 1073741670) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) .cse0 .cse1 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) .cse2 .cse3 .cse4 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 01:57:24,523 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 517) no Hoare annotation was computed. [2022-11-03 01:57:24,523 INFO L895 garLoopResultBuilder]: At program point L512-2(lines 512 517) the Hoare annotation is: (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,524 INFO L895 garLoopResultBuilder]: At program point L281(line 281) the Hoare annotation is: (and (= 3 ~s~0) (= ~pended~0 1) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,524 INFO L899 garLoopResultBuilder]: For program point L281-1(line 281) no Hoare annotation was computed. [2022-11-03 01:57:24,524 INFO L895 garLoopResultBuilder]: At program point L381(line 381) the Hoare annotation is: false [2022-11-03 01:57:24,524 INFO L899 garLoopResultBuilder]: For program point L381-1(lines 377 383) no Hoare annotation was computed. [2022-11-03 01:57:24,524 INFO L899 garLoopResultBuilder]: For program point L1339(lines 1339 1544) no Hoare annotation was computed. [2022-11-03 01:57:24,524 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 423) no Hoare annotation was computed. [2022-11-03 01:57:24,525 INFO L895 garLoopResultBuilder]: At program point L811(lines 798 831) the Hoare annotation is: (let ((.cse12 (= ~s~0 ~DC~0)) (.cse4 (= ~NP~0 1)) (.cse5 (not (= ~MPR3~0 1))) (.cse7 (= ~compRegistered~0 0)) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse9 (= ~SKIP1~0 3))) (let ((.cse13 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0)) (.cse11 (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|))) (.cse10 (or (and (= ~compRegistered~0 1) .cse12 .cse4 .cse5 .cse8 .cse9) (and .cse12 .cse4 .cse5 .cse7 .cse8 .cse9))) (.cse0 (<= ~SKIP2~0 ~s~0)) (.cse1 (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1))) (.cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ 5 ~DC~0) ~IPC~0))) (or (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse0 .cse1 .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= 6 ~MPR3~0) .cse10 .cse11 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (or (<= |ULTIMATE.start_FloppyPnp_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res#1|)) .cse3 .cse6) (and .cse12 (= |ULTIMATE.start_main_~status~1#1| 0) .cse9) (and (<= (+ 1073741738 |ULTIMATE.start_FloppyDeviceControl_#res#1|) 0) .cse12 .cse13 .cse9) (and .cse12 .cse13 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse9) (and (or (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res#1|)) .cse10 (or (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|) (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 259)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|)) .cse11 (or (not (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 258)) (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1|)) .cse3 .cse6) (and (= ~pended~0 1) .cse9) (and .cse10 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_~ntStatus~4#1| 1073741536) 0) .cse6) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res#1|) (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| ~lowerDriverReturn~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2022-11-03 01:57:24,525 INFO L895 garLoopResultBuilder]: At program point L745(lines 745 775) the Hoare annotation is: (and (<= 6 ~MPR3~0) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,526 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (<= 6 ~MPR3~0) (= ~setEventCalled~0 1) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (or .cse0 (= ~MPR3~0 ~s~0)) (or (<= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (or .cse0 (= 259 |ULTIMATE.start_FloppyStartDevice_~__cil_tmp42~0#1|)) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3))) [2022-11-03 01:57:24,526 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-11-03 01:57:24,526 INFO L899 garLoopResultBuilder]: For program point L1472(lines 1472 1480) no Hoare annotation was computed. [2022-11-03 01:57:24,526 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,526 INFO L899 garLoopResultBuilder]: For program point L415-1(line 415) no Hoare annotation was computed. [2022-11-03 01:57:24,527 INFO L895 garLoopResultBuilder]: At program point L1340(lines 1330 1546) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,527 INFO L895 garLoopResultBuilder]: At program point L250(line 250) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,527 INFO L899 garLoopResultBuilder]: For program point L250-1(line 250) no Hoare annotation was computed. [2022-11-03 01:57:24,527 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 01:57:24,527 INFO L895 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,528 INFO L899 garLoopResultBuilder]: For program point L1275(lines 1275 1287) no Hoare annotation was computed. [2022-11-03 01:57:24,528 INFO L899 garLoopResultBuilder]: For program point L1308-1(line 1308) no Hoare annotation was computed. [2022-11-03 01:57:24,528 INFO L899 garLoopResultBuilder]: For program point L1275-2(lines 1274 1563) no Hoare annotation was computed. [2022-11-03 01:57:24,528 INFO L899 garLoopResultBuilder]: For program point L219(lines 219 422) no Hoare annotation was computed. [2022-11-03 01:57:24,528 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2022-11-03 01:57:24,528 INFO L895 garLoopResultBuilder]: At program point L550-2(lines 550 566) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (= ~pended~0 0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP1~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse5 .cse6 .cse7 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse8 .cse9 .cse10))) [2022-11-03 01:57:24,529 INFO L895 garLoopResultBuilder]: At program point L418(lines 229 419) the Hoare annotation is: (let ((.cse8 (= ~compRegistered~0 0)) (.cse11 (= ~s~0 ~DC~0)) (.cse5 (not (= ~MPR3~0 1))) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (= ~pended~0 0)) (.cse10 (= ~SKIP1~0 3))) (let ((.cse3 (or (and .cse11 .cse5 .cse6 .cse7 .cse8 .cse10) (and (= ~compRegistered~0 1) .cse11 .cse5 .cse6 .cse7 .cse10))) (.cse12 (= ~pended~0 1)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~NP~0 1)) (.cse2 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse4 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0))) (or (and (<= 6 ~MPR3~0) (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) .cse0 .cse1 .cse5 .cse6 .cse2 .cse7 (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse12 .cse6 .cse8 .cse10) (and .cse12 .cse0 .cse1 .cse5 .cse6 .cse2 .cse8 .cse4 .cse9 .cse10)))) [2022-11-03 01:57:24,529 INFO L899 garLoopResultBuilder]: For program point L1376(lines 1376 1534) no Hoare annotation was computed. [2022-11-03 01:57:24,529 INFO L895 garLoopResultBuilder]: At program point L352(line 352) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~customIrp~0 0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (= ~pended~0 0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP1~0 3))) (or (and .cse0 .cse1 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) .cse2 (= ~myStatus~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ~setEventCalled~0 1) (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-03 01:57:24,529 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 331) no Hoare annotation was computed. [2022-11-03 01:57:24,530 INFO L895 garLoopResultBuilder]: At program point L220(lines 216 423) the Hoare annotation is: (and (<= 6 ~MPR3~0) (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,530 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 589) no Hoare annotation was computed. [2022-11-03 01:57:24,530 INFO L895 garLoopResultBuilder]: At program point L551(lines 550 566) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~NP~0 1)) (.cse6 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse8 (= ~pended~0 0)) (.cse9 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP1~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 1) 0)) (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse5 .cse6 .cse7 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse8 .cse9 .cse10))) [2022-11-03 01:57:24,530 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 584 589) no Hoare annotation was computed. [2022-11-03 01:57:24,531 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1479) no Hoare annotation was computed. [2022-11-03 01:57:24,531 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: false [2022-11-03 01:57:24,531 INFO L895 garLoopResultBuilder]: At program point L222(lines 222 421) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,531 INFO L899 garLoopResultBuilder]: For program point L817(lines 817 829) no Hoare annotation was computed. [2022-11-03 01:57:24,531 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 1616) no Hoare annotation was computed. [2022-11-03 01:57:24,532 INFO L895 garLoopResultBuilder]: At program point L586(lines 586 587) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (<= 6 ~MPR3~0)) (.cse2 (= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 0)) (.cse3 (<= 0 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|)) (.cse4 (= ~s~0 ~NP~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse7 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse8 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse9 (= ~pended~0 0)) (.cse10 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse11 (= ~SKIP1~0 3))) (or (and (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1|) (<= |ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2#1| 258)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (<= |ULTIMATE.start_FlFdcDeviceIo_#res#1| 258) (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res#1|)) .cse6 .cse7 .cse8 (or (<= 260 |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1|) (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 258)) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyStartDevice_~ntStatus~1#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-11-03 01:57:24,532 INFO L899 garLoopResultBuilder]: For program point L586-1(lines 586 587) no Hoare annotation was computed. [2022-11-03 01:57:24,532 INFO L895 garLoopResultBuilder]: At program point L289(line 289) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (= ~SKIP1~0 3))) (or (and (<= (+ |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 1073741823) 0) .cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) .cse1 (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) .cse2 (<= (+ 2 ~DC~0) ~SKIP2~0) .cse3) (and (= ~pended~0 1) .cse0 .cse1 .cse2 .cse3))) [2022-11-03 01:57:24,532 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:57:24,532 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1285) no Hoare annotation was computed. [2022-11-03 01:57:24,533 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (and (<= 6 ~MPR3~0) (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~customIrp~0 0) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,533 INFO L899 garLoopResultBuilder]: For program point L256-1(line 256) no Hoare annotation was computed. [2022-11-03 01:57:24,533 INFO L899 garLoopResultBuilder]: For program point L818(lines 818 822) no Hoare annotation was computed. [2022-11-03 01:57:24,533 INFO L899 garLoopResultBuilder]: For program point L752(line 752) no Hoare annotation was computed. [2022-11-03 01:57:24,533 INFO L895 garLoopResultBuilder]: At program point L389(line 389) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,533 INFO L899 garLoopResultBuilder]: For program point L389-1(line 389) no Hoare annotation was computed. [2022-11-03 01:57:24,534 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1542) no Hoare annotation was computed. [2022-11-03 01:57:24,534 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 330) no Hoare annotation was computed. [2022-11-03 01:57:24,534 INFO L899 garLoopResultBuilder]: For program point L324-1(lines 319 331) no Hoare annotation was computed. [2022-11-03 01:57:24,534 INFO L895 garLoopResultBuilder]: At program point L225(lines 225 420) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,534 INFO L895 garLoopResultBuilder]: At program point L820(line 820) the Hoare annotation is: false [2022-11-03 01:57:24,535 INFO L895 garLoopResultBuilder]: At program point L787(lines 780 835) the Hoare annotation is: (let ((.cse4 (= ~compRegistered~0 0)) (.cse2 (= ~s~0 ~DC~0)) (.cse8 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse6 (= ~pended~0 0)) (.cse10 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse5 (= ~SKIP1~0 3))) (let ((.cse3 (= ~pended~0 1)) (.cse12 (<= 5 ~MPR1~0)) (.cse13 (< |ULTIMATE.start_main_~status~1#1| (+ ~lowerDriverReturn~0 1))) (.cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_main_~status~1#1|)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse15 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741738) 0)) (.cse0 (or (and .cse2 .cse8 .cse9 .cse6 .cse4 .cse10 .cse5) (and (= ~compRegistered~0 1) .cse2 .cse8 .cse9 .cse6 .cse10 .cse5))) (.cse16 (or (<= |ULTIMATE.start_main_~status~1#1| 258) (<= 260 |ULTIMATE.start_main_~status~1#1|))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= (+ 5 ~DC~0) ~IPC~0))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~status~1#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res#1| 1073741536) 0) (<= (+ |ULTIMATE.start_FloppyQueueRequest_~ntStatus~4#1| 1073741536) 0) .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 (= |ULTIMATE.start_main_~status~1#1| 0) .cse6 .cse5) (and .cse3 .cse7 .cse8 .cse9 .cse1 .cse4 .cse10 .cse11 (not (= ~s~0 1)) .cse5) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) .cse12 .cse13 .cse14 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse8 .cse9 .cse1 .cse6 .cse4 .cse10 .cse11 .cse5) (and (<= (+ 1073741738 |ULTIMATE.start_FloppyDeviceControl_#res#1|) 0) .cse2 .cse15 .cse6 .cse5) (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res#1|) .cse12 (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| ~lowerDriverReturn~0) .cse13 .cse14 .cse8 .cse9 .cse1 .cse6 .cse4 .cse10 .cse11 .cse5) (and (or (<= |ULTIMATE.start_FloppyDeviceControl_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res#1|)) (or (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|) (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 259)) .cse0 (or (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1|)) .cse16 (or (not (<= |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1| 258)) (<= |ULTIMATE.start_FloppyDeviceControl_~ntStatus~3#1| |ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0#1|)) .cse7 .cse1) (and .cse2 .cse15 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse6 .cse5) (and (<= 6 ~MPR3~0) .cse0 .cse16 (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (or (<= |ULTIMATE.start_FloppyPnp_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res#1|)) .cse7 .cse1)))) [2022-11-03 01:57:24,535 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 396) no Hoare annotation was computed. [2022-11-03 01:57:24,536 INFO L895 garLoopResultBuilder]: At program point L391-2(lines 229 417) the Hoare annotation is: (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,537 INFO L895 garLoopResultBuilder]: At program point L1316(lines 1316 1550) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,537 INFO L895 garLoopResultBuilder]: At program point L1614(line 1614) the Hoare annotation is: false [2022-11-03 01:57:24,537 INFO L899 garLoopResultBuilder]: For program point L1614-1(lines 1610 1616) no Hoare annotation was computed. [2022-11-03 01:57:24,537 INFO L895 garLoopResultBuilder]: At program point L1515(line 1515) the Hoare annotation is: false [2022-11-03 01:57:24,537 INFO L899 garLoopResultBuilder]: For program point L491(lines 491 503) no Hoare annotation was computed. [2022-11-03 01:57:24,537 INFO L899 garLoopResultBuilder]: For program point L1515-1(lines 1511 1517) no Hoare annotation was computed. [2022-11-03 01:57:24,538 INFO L899 garLoopResultBuilder]: For program point L1383(lines 1383 1532) no Hoare annotation was computed. [2022-11-03 01:57:24,538 INFO L895 garLoopResultBuilder]: At program point L326(line 326) the Hoare annotation is: false [2022-11-03 01:57:24,538 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 291) no Hoare annotation was computed. [2022-11-03 01:57:24,538 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2022-11-03 01:57:24,538 INFO L895 garLoopResultBuilder]: At program point L393(lines 393 394) the Hoare annotation is: (and (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| ~lowerDriverReturn~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,539 INFO L895 garLoopResultBuilder]: At program point L1384(lines 1376 1534) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,539 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 366) no Hoare annotation was computed. [2022-11-03 01:57:24,539 INFO L899 garLoopResultBuilder]: For program point L393-1(lines 393 394) no Hoare annotation was computed. [2022-11-03 01:57:24,539 INFO L895 garLoopResultBuilder]: At program point L228(lines 227 420) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,539 INFO L899 garLoopResultBuilder]: For program point L757(line 757) no Hoare annotation was computed. [2022-11-03 01:57:24,539 INFO L899 garLoopResultBuilder]: For program point L724(lines 724 726) no Hoare annotation was computed. [2022-11-03 01:57:24,540 INFO L895 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: false [2022-11-03 01:57:24,540 INFO L895 garLoopResultBuilder]: At program point L1484(lines 1348 1542) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,540 INFO L895 garLoopResultBuilder]: At program point L262(lines 262 263) the Hoare annotation is: (and (= ~pended~0 1) (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,540 INFO L899 garLoopResultBuilder]: For program point L295-1(lines 229 417) no Hoare annotation was computed. [2022-11-03 01:57:24,540 INFO L899 garLoopResultBuilder]: For program point L262-1(lines 262 263) no Hoare annotation was computed. [2022-11-03 01:57:24,541 INFO L899 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2022-11-03 01:57:24,541 INFO L899 garLoopResultBuilder]: For program point L1452(lines 1452 1455) no Hoare annotation was computed. [2022-11-03 01:57:24,541 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 629) no Hoare annotation was computed. [2022-11-03 01:57:24,541 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 593) no Hoare annotation was computed. [2022-11-03 01:57:24,541 INFO L899 garLoopResultBuilder]: For program point L528-1(lines 528 593) no Hoare annotation was computed. [2022-11-03 01:57:24,541 INFO L895 garLoopResultBuilder]: At program point L1321(lines 1321 1548) the Hoare annotation is: (and (= ~s~0 ~NP~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,542 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 206) no Hoare annotation was computed. [2022-11-03 01:57:24,542 INFO L895 garLoopResultBuilder]: At program point L826(line 826) the Hoare annotation is: false [2022-11-03 01:57:24,542 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 564) no Hoare annotation was computed. [2022-11-03 01:57:24,542 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 502) no Hoare annotation was computed. [2022-11-03 01:57:24,542 INFO L899 garLoopResultBuilder]: For program point L496-1(lines 491 503) no Hoare annotation was computed. [2022-11-03 01:57:24,542 INFO L895 garLoopResultBuilder]: At program point L364(line 364) the Hoare annotation is: false [2022-11-03 01:57:24,543 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 360 366) no Hoare annotation was computed. [2022-11-03 01:57:24,543 INFO L899 garLoopResultBuilder]: For program point L1554(lines 1554 1560) no Hoare annotation was computed. [2022-11-03 01:57:24,543 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 570) no Hoare annotation was computed. [2022-11-03 01:57:24,543 INFO L895 garLoopResultBuilder]: At program point L1521(lines 1521 1522) the Hoare annotation is: (and (= 3 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= |ULTIMATE.start_main_~status~1#1| 0) (<= (+ 5 ~DC~0) ~IPC~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ 2 ~DC~0) ~SKIP2~0) (= ~SKIP1~0 3)) [2022-11-03 01:57:24,543 INFO L899 garLoopResultBuilder]: For program point L1554-1(lines 1554 1560) no Hoare annotation was computed. [2022-11-03 01:57:24,543 INFO L899 garLoopResultBuilder]: For program point L1521-1(lines 1521 1522) no Hoare annotation was computed. [2022-11-03 01:57:24,544 INFO L895 garLoopResultBuilder]: At program point L431(lines 160 433) the Hoare annotation is: (let ((.cse2 (= ~pended~0 0)) (.cse0 (= ~s~0 ~DC~0)) (.cse11 (= ~pended~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ~NP~0 1)) (.cse9 (not (= ~MPR3~0 1))) (.cse1 (= |ULTIMATE.start_main_~status~1#1| 0)) (.cse7 (<= (+ 5 ~DC~0) ~IPC~0)) (.cse4 (= ~compRegistered~0 0)) (.cse8 (<= (+ 2 ~DC~0) ~SKIP2~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse3 (= ~SKIP1~0 3))) (or (and (<= 6 ~MPR3~0) (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse3)) (or (<= |ULTIMATE.start_FloppyPnp_~ntStatus~0#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_~ntStatus~0#1|)) (or (<= |ULTIMATE.start_FloppyPnp_#res#1| 258) (<= 260 |ULTIMATE.start_FloppyPnp_#res#1|)) .cse5 .cse6 .cse7 .cse8) (and (<= |ULTIMATE.start_FloppyPnp_#res#1| ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res#1|) .cse5 .cse6 .cse9 .cse1 .cse7 .cse2 .cse4 .cse8 .cse10 .cse3) (and .cse0 .cse1 (<= (+ 1073741738 |ULTIMATE.start_FloppyPnp_#res#1|) 0) .cse2 .cse3) (and .cse0 .cse11 .cse1 .cse4 .cse3) (and .cse11 .cse5 .cse6 .cse9 .cse1 .cse7 .cse4 .cse8 .cse10 .cse3))) [2022-11-03 01:57:24,544 INFO L895 garLoopResultBuilder]: At program point L960(line 960) the Hoare annotation is: (let ((.cse8 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse7 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse4 (not (<= 6 ~MPR3~0)) .cse6 (not (= ~compRegistered~0 1)) .cse8) (or .cse0 .cse1 .cse2 .cse3 (not (= ~pended~0 1)) .cse4 .cse5 .cse6 .cse7))) [2022-11-03 01:57:24,545 INFO L895 garLoopResultBuilder]: At program point L960-1(lines 952 965) the Hoare annotation is: (let ((.cse8 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse7 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse4 (not (<= 6 ~MPR3~0)) (let ((.cse9 (+ |IofCallDriver_~__cil_tmp7~0#1| 1073741802))) (and (= ~setEventCalled~0 1) (<= 0 .cse9) (= ~MPR1~0 ~s~0) (<= .cse9 0))) .cse6 (not (= ~compRegistered~0 1)) .cse8) (or .cse0 .cse1 .cse2 .cse3 (not (= ~pended~0 1)) .cse4 .cse5 .cse6 .cse7))) [2022-11-03 01:57:24,545 INFO L899 garLoopResultBuilder]: For program point L956(lines 956 962) no Hoare annotation was computed. [2022-11-03 01:57:24,545 INFO L895 garLoopResultBuilder]: At program point L1031(line 1031) the Hoare annotation is: (let ((.cse8 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (= 3 |old(~s~0)|))) (.cse6 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse7 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse4 (not (<= 6 ~MPR3~0)) .cse6 (not (= ~compRegistered~0 1)) .cse8) (or .cse0 .cse1 .cse2 .cse3 (not (= ~pended~0 1)) .cse4 .cse5 .cse6 .cse7))) [2022-11-03 01:57:24,545 INFO L899 garLoopResultBuilder]: For program point L1031-1(lines 1013 1035) no Hoare annotation was computed. [2022-11-03 01:57:24,546 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 966 1038) the Hoare annotation is: (let ((.cse6 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 3 |old(~s~0)|))) (.cse4 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse9 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse3 (not (<= 6 ~MPR3~0)) .cse4 .cse5 (not (= ~compRegistered~0 1)) .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse2 .cse7 (not (= ~pended~0 1)) .cse3 .cse8 .cse4 .cse5 .cse9))) [2022-11-03 01:57:24,546 INFO L895 garLoopResultBuilder]: At program point L974(lines 974 986) the Hoare annotation is: (let ((.cse6 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 3 |old(~s~0)|))) (.cse4 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse5 (= ~s~0 |old(~s~0)|)) (.cse9 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse3 (not (<= 6 ~MPR3~0)) .cse4 .cse5 (not (= ~compRegistered~0 1)) .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse2 .cse7 (not (= ~pended~0 1)) .cse3 .cse8 .cse4 .cse5 .cse9))) [2022-11-03 01:57:24,546 INFO L895 garLoopResultBuilder]: At program point L974-1(lines 974 986) the Hoare annotation is: (let ((.cse6 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 3 |old(~s~0)|))) (.cse5 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse9 (= ~s~0 |old(~s~0)|)) (.cse10 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse3 (not (<= 6 ~MPR3~0)) (let ((.cse4 (+ |IofCallDriver_~__cil_tmp7~0#1| 1073741802))) (and (= ~setEventCalled~0 1) (<= 0 .cse4) (= ~MPR1~0 ~s~0) (<= .cse4 0))) .cse5 (not (= ~compRegistered~0 1)) .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse5 .cse9 .cse10 .cse6) (or .cse0 .cse1 .cse2 .cse7 (not (= ~pended~0 1)) .cse3 .cse8 .cse5 .cse9 .cse10))) [2022-11-03 01:57:24,546 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 966 1038) no Hoare annotation was computed. [2022-11-03 01:57:24,547 INFO L899 garLoopResultBuilder]: For program point L1017(lines 1017 1034) no Hoare annotation was computed. [2022-11-03 01:57:24,547 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 984) no Hoare annotation was computed. [2022-11-03 01:57:24,547 INFO L895 garLoopResultBuilder]: At program point L1009(lines 973 1037) the Hoare annotation is: (let ((.cse6 (not (= ~pended~0 0))) (.cse0 (not (= ~NP~0 1))) (.cse1 (not (<= (+ 2 ~DC~0) ~SKIP2~0))) (.cse2 (not (= ~SKIP1~0 3))) (.cse7 (not (= ~compRegistered~0 0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= 3 |old(~s~0)|))) (.cse5 (not (<= (+ 5 ~DC~0) ~IPC~0))) (.cse9 (= ~s~0 |old(~s~0)|)) (.cse10 (= ~MPR3~0 1))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) (and (not (<= (+ ~myStatus~0 1073741637) 0)) (not (= ~myStatus~0 0))) .cse3 (not (<= 6 ~MPR3~0)) (let ((.cse4 (+ |IofCallDriver_~__cil_tmp7~0#1| 1073741802))) (and (= ~setEventCalled~0 1) (<= 0 .cse4) (= ~MPR1~0 ~s~0) (<= .cse4 0))) .cse5 (not (= ~compRegistered~0 1)) .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse8 .cse5 .cse9 .cse10 .cse6) (or .cse0 .cse1 .cse2 .cse7 (not (= ~pended~0 1)) .cse3 .cse8 .cse5 .cse9 .cse10))) [2022-11-03 01:57:24,547 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1033) no Hoare annotation was computed. [2022-11-03 01:57:24,548 INFO L895 garLoopResultBuilder]: At program point L118(lines 118 148) the Hoare annotation is: (or (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (not (= ~SKIP1~0 3)) (not (= ~compRegistered~0 0)) (not (= ~s~0 ~NP~0)) (not (= |old(~pended~0)| 0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ 5 ~DC~0) ~IPC~0)) (= ~pended~0 0) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-11-03 01:57:24,548 INFO L899 garLoopResultBuilder]: For program point L118-2(lines 110 158) no Hoare annotation was computed. [2022-11-03 01:57:24,548 INFO L899 garLoopResultBuilder]: For program point FlQueueIrpToThreadEXIT(lines 97 159) no Hoare annotation was computed. [2022-11-03 01:57:24,548 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 146) no Hoare annotation was computed. [2022-11-03 01:57:24,549 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2022-11-03 01:57:24,549 INFO L899 garLoopResultBuilder]: For program point FlQueueIrpToThreadFINAL(lines 97 159) no Hoare annotation was computed. [2022-11-03 01:57:24,549 INFO L895 garLoopResultBuilder]: At program point FlQueueIrpToThreadENTRY(lines 97 159) the Hoare annotation is: (or (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (not (= ~SKIP1~0 3)) (not (= ~compRegistered~0 0)) (not (= ~s~0 ~NP~0)) (not (= |old(~pended~0)| 0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ 5 ~DC~0) ~IPC~0)) (= ~pended~0 0) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-11-03 01:57:24,550 INFO L895 garLoopResultBuilder]: At program point L129(lines 129 136) the Hoare annotation is: (or (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (not (= ~SKIP1~0 3)) (not (= ~compRegistered~0 0)) (not (= ~s~0 ~NP~0)) (not (= |old(~pended~0)| 0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ 5 ~DC~0) ~IPC~0)) (= ~pended~0 0) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-11-03 01:57:24,550 INFO L895 garLoopResultBuilder]: At program point L154(line 154) the Hoare annotation is: (or (not (<= (+ 2 ~DC~0) ~SKIP2~0)) (not (= ~SKIP1~0 3)) (not (= ~compRegistered~0 0)) (not (= ~s~0 ~NP~0)) (not (= |old(~pended~0)| 0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ 5 ~DC~0) ~IPC~0)) (not (= ~s~0 1)) (= ~MPR3~0 1)) [2022-11-03 01:57:24,550 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 150 156) no Hoare annotation was computed. [2022-11-03 01:57:24,550 INFO L895 garLoopResultBuilder]: At program point L1177(line 1177) the Hoare annotation is: (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~pended~0 0))) [2022-11-03 01:57:24,550 INFO L899 garLoopResultBuilder]: For program point L1177-1(line 1177) no Hoare annotation was computed. [2022-11-03 01:57:24,550 INFO L899 garLoopResultBuilder]: For program point FloppyCreateCloseEXIT(lines 1168 1181) no Hoare annotation was computed. [2022-11-03 01:57:24,551 INFO L895 garLoopResultBuilder]: At program point FloppyCreateCloseENTRY(lines 1168 1181) the Hoare annotation is: (or (not (= ~SKIP1~0 3)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~pended~0 0))) [2022-11-03 01:57:24,554 INFO L444 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, 1, 1, 1, 1, 1] [2022-11-03 01:57:24,556 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:57:24,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:57:24 BoogieIcfgContainer [2022-11-03 01:57:24,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:57:24,642 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:57:24,642 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:57:24,642 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:57:24,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:42" (3/4) ... [2022-11-03 01:57:24,647 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 01:57:24,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-11-03 01:57:24,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2022-11-03 01:57:24,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-03 01:57:24,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-03 01:57:24,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-03 01:57:24,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2022-11-03 01:57:24,653 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2022-11-03 01:57:24,679 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2022-11-03 01:57:24,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2022-11-03 01:57:24,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-03 01:57:24,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 01:57:24,716 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC) || (((s == DC && pended == 1) && compRegistered == 0) && SKIP1 == 3)) || (((pended == 1 && s == NP) && compRegistered == 0) && SKIP1 == 3)) || (((s == DC && status == 0) && pended == 0) && SKIP1 == 3)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && pended == 0) && SKIP1 == 3)) || ((((((((((((lowerDriverReturn <= \result && 5 <= MPR1) && \result <= lowerDriverReturn) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || ((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || ((((((6 <= MPR3 && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC) [2022-11-03 01:57:24,717 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC) || (((s == DC && pended == 1) && compRegistered == 0) && SKIP1 == 3)) || (((s == DC && status == 0) && pended == 0) && SKIP1 == 3)) || (((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && !(s == 1)) && SKIP1 == 3)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && pended == 0) && SKIP1 == 3)) || ((((((((((((lowerDriverReturn <= \result && 5 <= MPR1) && \result <= lowerDriverReturn) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || ((((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || ((((((6 <= MPR3 && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC) [2022-11-03 01:57:24,717 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC) || ((s == DC && status == 0) && SKIP1 == 3)) || (((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && SKIP1 == 3)) || ((s == DC && pended == 1) && SKIP1 == 3)) || (((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || (((((((((((\result <= lowerDriverReturn && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || (((((((((((lowerDriverReturn <= \result && \result <= lowerDriverReturn) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC)) || ((((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && !(MPR3 == s)) && !(s == 1)) && SKIP1 == 3) [2022-11-03 01:57:24,718 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\result <= lowerDriverReturn && SKIP2 <= s) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || ((s == DC && status == 0) && SKIP1 == 3)) || (((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && SKIP1 == 3)) || (((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || (pended == 1 && SKIP1 == 3)) || ((((((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC)) || (((((((((((lowerDriverReturn <= \result && \result <= lowerDriverReturn) && SKIP2 <= s) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) [2022-11-03 01:57:24,719 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || !(pended == 1)) || s == NP) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || MPR3 == 1) && ((((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(5 + DC <= IPC)) || !(\old(setEventCalled) == 1)) || (\old(customIrp) == customIrp && s == NP)) || !(compRegistered == 1)) || ((((setEventCalled == 1 && \old(customIrp) == 1) && customIrp == 0) && s == \old(s)) && !(MPR3 == \old(s)))) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || !(pended == 0)) [2022-11-03 01:57:24,719 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || MPR3 == 1) || !(pended == 0)) && ((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(5 + DC <= IPC)) || !(compRegistered == 1)) || !(pended == 0))) && ((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || MPR3 == 1) [2022-11-03 01:57:24,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(5 + DC <= IPC)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) [2022-11-03 01:57:24,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((compRegistered == 1 && 6 <= MPR3) && ((260 <= ntStatus || ntStatus <= 258) || !(s == 1))) && s == DC) && ntStatus == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && ((\result <= 258 || 260 <= \result) || !(s == 1))) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0)) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && s == DC) && ntStatus == 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) [2022-11-03 01:57:24,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((pended == 1 && s == NP) && status == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((((((lowerDriverReturn <= \result && 5 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((s == DC && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) || ((((((((((((((\result <= 258 || 260 <= \result) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) || ((((s == DC && pended == 1) && status == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((1073741738 + \result <= 0 && s == DC) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) [2022-11-03 01:57:24,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((6 <= MPR3 && (((((compRegistered == 1 && s == DC) && status == 0) && pended == 0) && SKIP1 == 3) || ((((s == DC && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 5 + DC <= IPC) && 2 + DC <= SKIP2) || (((((((((((\result <= lowerDriverReturn && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((s == DC && status == 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || ((((s == DC && pended == 1) && status == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3) [2022-11-03 01:57:24,731 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(5 + DC <= IPC)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) [2022-11-03 01:57:24,731 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((compRegistered == 1 && 6 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && \result + 1073741670 <= 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) [2022-11-03 01:57:24,731 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(5 + DC <= IPC)) || s == \old(s)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) [2022-11-03 01:57:24,731 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(5 + DC <= IPC)) || !(\old(setEventCalled) == 1)) || (((\old(customIrp) == customIrp && setEventCalled == 1) && s == \old(s)) && !(MPR3 == \old(s)))) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) [2022-11-03 01:57:24,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && 0 <= ntStatus) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 [2022-11-03 01:57:24,732 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && 0 <= ntStatus) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 [2022-11-03 01:57:24,733 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) [2022-11-03 01:57:24,733 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) [2022-11-03 01:57:24,733 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && ntStatus <= 0) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) || (((((((((((compRegistered == 1 && 6 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0) [2022-11-03 01:57:24,735 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(2 + DC <= SKIP2) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(s == NP)) || !(\old(pended) == 0)) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || pended == 0) || !(s == 1)) || MPR3 == 1 [2022-11-03 01:57:24,735 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(2 + DC <= SKIP2) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(s == NP)) || !(\old(pended) == 0)) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || pended == 0) || !(s == 1)) || MPR3 == 1 [2022-11-03 01:57:24,852 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:57:24,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:57:24,852 INFO L158 Benchmark]: Toolchain (without parser) took 44766.66ms. Allocated memory was 90.2MB in the beginning and 564.1MB in the end (delta: 474.0MB). Free memory was 55.9MB in the beginning and 274.0MB in the end (delta: -218.1MB). Peak memory consumption was 254.8MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,853 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 90.2MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:57:24,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.69ms. Allocated memory is still 90.2MB. Free memory was 55.6MB in the beginning and 51.5MB in the end (delta: 4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.37ms. Allocated memory is still 90.2MB. Free memory was 51.5MB in the beginning and 45.0MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,854 INFO L158 Benchmark]: Boogie Preprocessor took 98.05ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 40.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,862 INFO L158 Benchmark]: RCFGBuilder took 1684.76ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 40.8MB in the beginning and 70.7MB in the end (delta: -29.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,863 INFO L158 Benchmark]: TraceAbstraction took 42028.81ms. Allocated memory was 119.5MB in the beginning and 564.1MB in the end (delta: 444.6MB). Free memory was 70.4MB in the beginning and 293.9MB in the end (delta: -223.5MB). Peak memory consumption was 323.0MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,864 INFO L158 Benchmark]: Witness Printer took 210.03ms. Allocated memory is still 564.1MB. Free memory was 293.9MB in the beginning and 274.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-03 01:57:24,866 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.23ms. Allocated memory is still 90.2MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.69ms. Allocated memory is still 90.2MB. Free memory was 55.6MB in the beginning and 51.5MB in the end (delta: 4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.37ms. Allocated memory is still 90.2MB. Free memory was 51.5MB in the beginning and 45.0MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.05ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 40.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1684.76ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 40.8MB in the beginning and 70.7MB in the end (delta: -29.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42028.81ms. Allocated memory was 119.5MB in the beginning and 564.1MB in the end (delta: 444.6MB). Free memory was 70.4MB in the beginning and 293.9MB in the end (delta: -223.5MB). Peak memory consumption was 323.0MB. Max. memory is 16.1GB. * Witness Printer took 210.03ms. Allocated memory is still 564.1MB. Free memory was 293.9MB in the beginning and 274.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 225 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.9s, OverallIterations: 53, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8104 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7953 mSDsluCounter, 32165 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25024 mSDsCounter, 1005 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9945 IncrementalHoareTripleChecker+Invalid, 10950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1005 mSolverCounterUnsat, 10472 mSDtfsCounter, 9945 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=12, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 53 MinimizatonAttempts, 549 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 99 LocationsWithAnnotation, 747 PreInvPairs, 955 NumberOfFragments, 7320 HoareAnnotationTreeSize, 747 FomulaSimplifications, 15999 FormulaSimplificationTreeSizeReduction, 6.8s HoareSimplificationTime, 99 FomulaSimplificationsInter, 274459 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1840 ConstructedInterpolants, 0 QuantifiedInterpolants, 5043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 75/75 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 1 specifications checked. All of them hold - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC) || (((s == DC && pended == 1) && compRegistered == 0) && SKIP1 == 3)) || (((pended == 1 && s == NP) && compRegistered == 0) && SKIP1 == 3)) || (((s == DC && status == 0) && pended == 0) && SKIP1 == 3)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && pended == 0) && SKIP1 == 3)) || ((((((((((((lowerDriverReturn <= \result && 5 <= MPR1) && \result <= lowerDriverReturn) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || ((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || ((((((6 <= MPR3 && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((((((((((lowerDriverReturn <= ntStatus && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && ntStatus <= lowerDriverReturn) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: ((((((((pended == 1 && s == NP) && status == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((((((lowerDriverReturn <= \result && 5 <= MPR1) && \result <= lowerDriverReturn) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((s == DC && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) || ((((((((((((((\result <= 258 || 260 <= \result) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) || ((((s == DC && pended == 1) && status == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((1073741738 + \result <= 0 && s == DC) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) - InvariantResult [Line: 735]: Loop Invariant Derived loop invariant: (((s == NP && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && \result + 1073741670 <= 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: ((((((((((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC) || ((s == DC && status == 0) && SKIP1 == 3)) || (((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && SKIP1 == 3)) || ((s == DC && pended == 1) && SKIP1 == 3)) || (((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || (((((((((((\result <= lowerDriverReturn && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || (((((((((((lowerDriverReturn <= \result && \result <= lowerDriverReturn) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC)) || ((((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && !(MPR3 == s)) && !(s == 1)) && SKIP1 == 3) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(5 + DC <= IPC)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((6 <= MPR3 && ntStatus == 0) && (myStatus + 1073741637 <= 0 || myStatus == 0)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((((((((6 <= MPR3 && (myStatus + 1073741637 <= 0 || myStatus == 0)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && 0 <= ntStatus) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((\result <= lowerDriverReturn && SKIP2 <= s) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((6 <= MPR3 && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || ((s == DC && status == 0) && SKIP1 == 3)) || (((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && SKIP1 == 3)) || (((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || (pended == 1 && SKIP1 == 3)) || ((((((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((s == DC && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC)) || (((((((((((lowerDriverReturn <= \result && \result <= lowerDriverReturn) && SKIP2 <= s) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: (((((((((((((((s <= DC && 6 <= MPR3) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && myStatus == 0) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && !(MPR1 == s)) && !(MPR3 == s)) && !(s == 1)) && SKIP1 == 3 - InvariantResult [Line: 1321]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(5 + DC <= IPC)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(5 + DC <= IPC)) || s == \old(s)) || !(compRegistered == 1)) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) || !(pended == 0))) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && ntStatus <= 0) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) || (((((((((((compRegistered == 1 && 6 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0) - InvariantResult [Line: 740]: Loop Invariant Derived loop invariant: ((((((((((6 <= MPR3 && (myStatus + 1073741637 <= 0 || myStatus == 0)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((((((!(2 + DC <= SKIP2) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(s == NP)) || !(\old(pended) == 0)) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || pended == 0) || !(s == 1)) || MPR3 == 1 - InvariantResult [Line: 597]: Loop Invariant Derived loop invariant: (((((((((((((((compRegistered == 1 && 6 <= MPR3) && ((260 <= ntStatus || ntStatus <= 258) || !(s == 1))) && s == DC) && ntStatus == 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && ((\result <= 258 || 260 <= \result) || !(s == 1))) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0)) || ((((((((((((compRegistered == 1 && 6 <= MPR3) && s == DC) && ntStatus == 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && 0 <= ntStatus) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((((6 <= MPR3 && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP1 + 2 <= MPR1) && NP == 1) && 5 + DC <= IPC) && ((((((s == DC && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((compRegistered == 1 && s == DC) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3))) && 2 + DC <= SKIP2) || (((((ntStatus + 1073741823 <= 0 && SKIP1 + 2 <= MPR1) && NP == 1) && 5 + DC <= IPC) && ((((((s == DC && !(MPR3 == 1)) && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3) || (((((compRegistered == 1 && s == DC) && !(MPR3 == 1)) && status == 0) && pended == 0) && SKIP1 == 3))) && 2 + DC <= SKIP2)) || (((((((((((lowerDriverReturn <= ntStatus && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && ntStatus <= lowerDriverReturn) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((s == DC && pended == 1) && status == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3) - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || !(pended == 1)) || s == NP) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || MPR3 == 1) && ((((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(5 + DC <= IPC)) || !(\old(setEventCalled) == 1)) || (\old(customIrp) == customIrp && s == NP)) || !(compRegistered == 1)) || ((((setEventCalled == 1 && \old(customIrp) == 1) && customIrp == 0) && s == \old(s)) && !(MPR3 == \old(s)))) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || !(pended == 0)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((!(2 + DC <= SKIP2) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(s == NP)) || !(\old(pended) == 0)) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || pended == 0) || !(s == 1)) || MPR3 == 1 - InvariantResult [Line: 931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3)) && status + 1073741536 <= 0) && \result + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) && 5 + DC <= IPC) || (((s == DC && pended == 1) && compRegistered == 0) && SKIP1 == 3)) || (((s == DC && status == 0) && pended == 0) && SKIP1 == 3)) || (((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && !(s == 1)) && SKIP1 == 3)) || ((((((((((((\result <= lowerDriverReturn && 5 <= MPR1) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((1073741738 + \result <= 0 && s == DC) && status + 1073741738 <= 0) && pended == 0) && SKIP1 == 3)) || ((((((((((((lowerDriverReturn <= \result && 5 <= MPR1) && \result <= lowerDriverReturn) && status < lowerDriverReturn + 1) && lowerDriverReturn <= status) && NP == 1) && !(MPR3 == 1)) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((((((\result <= 258 || 260 <= \result) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (status <= 258 || 260 <= status)) && (!(__cil_tmp91 <= 258) || ntStatus <= __cil_tmp91)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC)) || ((((s == DC && status + 1073741738 <= 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || ((((((6 <= MPR3 && (((((((s == DC && NP == 1) && !(MPR3 == 1)) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) || ((((((compRegistered == 1 && s == DC) && NP == 1) && !(MPR3 == 1)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3))) && (status <= 258 || 260 <= status)) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && 5 + DC <= IPC) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 1376]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && (myStatus + 1073741637 <= 0 || myStatus == 0)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || !(5 + DC <= IPC)) || !(\old(setEventCalled) == 1)) || (((\old(customIrp) == customIrp && setEventCalled == 1) && s == \old(s)) && !(MPR3 == \old(s)))) || !(compRegistered == 1)) || (!(NP == \old(s)) && !(MPR3 == \old(s)))) || !(pended == 0)) && (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(5 + DC <= IPC)) || s == \old(s)) || MPR3 == 1) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((6 <= MPR3 && (ntStatus <= 258 || 260 <= ntStatus)) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 1401]: Loop Invariant Derived loop invariant: ((((pended == 1 && s == NP) && status == 0) && compRegistered == 0) && SKIP1 == 3) || ((((((((((ntStatus <= 0 && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((6 <= MPR3 && (((((compRegistered == 1 && s == DC) && status == 0) && pended == 0) && SKIP1 == 3) || ((((s == DC && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3))) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP1 + 2 <= MPR1) && NP == 1) && 5 + DC <= IPC) && 2 + DC <= SKIP2) || (((((((((((\result <= lowerDriverReturn && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3)) || ((((s == DC && status == 0) && 1073741738 + \result <= 0) && pended == 0) && SKIP1 == 3)) || ((((s == DC && pended == 1) && status == 0) && compRegistered == 0) && SKIP1 == 3)) || (((((((((pended == 1 && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP2 == s) && SKIP1 == 3) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 1390]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: (((s == NP && status == 0) && pended == 0) && compRegistered == 0) && SKIP1 == 3 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: ((((((((s == NP && SKIP1 + 2 <= MPR1) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: ((((((((((6 <= MPR3 && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && customIrp == 0) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3 - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((((compRegistered == 1 && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && NP == 1) && status == 0) && 5 + DC <= IPC) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) && ntStatus + 1 <= 0) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && compRegistered == 1) && 6 <= MPR3) && ntStatus == 0) && s == NP) && SKIP1 + 2 <= MPR1) && (\result <= 258 || 260 <= \result)) && NP == 1) && status == 0) && 5 + DC <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && pended == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: ((((pended == 1 && s == NP) && status == 0) && compRegistered == 0) && SKIP1 == 3) || (((((((((s == DC && ntStatus + 1073741536 <= 0) && NP == 1) && !(MPR3 == 1)) && status == 0) && 5 + DC <= IPC) && pended == 0) && compRegistered == 0) && 2 + DC <= SKIP2) && SKIP1 == 3) - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || MPR3 == 1) || !(pended == 0)) && ((((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(NP == \old(s))) || (!(myStatus + 1073741637 <= 0) && !(myStatus == 0))) || !(SKIP1 + 2 <= MPR1)) || !(6 <= MPR3)) || (((setEventCalled == 1 && 0 <= __cil_tmp7 + 1073741802) && MPR1 == s) && __cil_tmp7 + 1073741802 <= 0)) || !(5 + DC <= IPC)) || !(compRegistered == 1)) || !(pended == 0))) && ((((((((!(NP == 1) || !(2 + DC <= SKIP2)) || !(SKIP1 == 3)) || !(compRegistered == 0)) || !(pended == 1)) || !(SKIP1 + 2 <= MPR1)) || !(3 == \old(s))) || !(5 + DC <= IPC)) || MPR3 == 1) RESULT: Ultimate proved your program to be correct! [2022-11-03 01:57:24,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b08fc0bc-2785-4975-b149-a0272de5b7ee/bin/utaipan-7li7fVZpFI/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